On central spanning trees of a graph

DOI10.1007/3-540-61576-8_73MaRDI QIDQ6567670zbMATH OpenFDO

Authors S. I. Bezrukov, Firoz Kaderali, Werner Poguntke

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61576-8_73

zbMATH Keywords

central vertexcircuit analysis

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Heuristics for the central tree problem
• The minimum centroid branch spanning tree problem
• Centering a spanning tree of a biconnected graph
• Tree Spanners
• scientific article; zbMATH DE number 3891405

Cited in

(1)

• The minimum centroid branch spanning tree problem

This page was built for publication: On central spanning trees of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567670)