Abstract
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically difficult and leads to an NP-complete problem.
Cite
CITATION STYLE
Bezrukov, S., Kaderali, F., & Poguntke, W. (1996). On central spanning trees of a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1120, pp. 53–57). Springer Verlag. https://doi.org/10.1007/3-540-61576-8_73
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
