11573/1196846 - 2019 -
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs Calamoneri, Tiziana; Dell'orefice, Matteo; Monti, Angelo - 01a Articolo in rivista
rivista: THEORETICAL COMPUTER SCIENCE (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 2-14 - issn: 0304-3975 - wos: WOS:000463124000002 (0) - scopus: 2-s2.0-85042925912 (0)
11573/958890 - 2016 -
A locally connected spanning tree can be found in polynomial time on simple clique 3-trees Calamoneri, Tiziana; Dell'orefice, Matteo; Monti, Angelo - 04b Atto di convegno in volume
congresso: Italian Conference on Theoretical Computer Science 2017 (Lecce, Italy)
libro: Proceedings of the 17th Italian Conference on Theoretical Computer Science - ()