Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti. A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. Theoretical Computer Science, 764:2-14, 2019. [doi]
@article{CalamoneriDM19,
title = {A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs},
author = {Tiziana Calamoneri and Matteo Dell'Orefice and Angelo Monti},
year = {2019},
doi = {10.1016/j.tcs.2018.02.025},
url = {https://doi.org/10.1016/j.tcs.2018.02.025},
researchr = {https://researchr.org/publication/CalamoneriDM19},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {764},
pages = {2-14},
}