Diameter-preserving spanning trees in sparse weighted graphs

DOI10.1007/S00373-010-0887-ZzbMath1205.05053OpenAlexW1969997664MaRDI QIDQ968216

B. E. Eshmatov

Publication date: 5 May 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0887-z

zbMATH Keywords

weighted graphdiameter-preserving spanning treeminimum diameter spanning treeshortest-paths tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Signed and weighted graphs (05C22)

Related Items (2)

A cooperative location game based on the 1-center location problem ⋮ Spanning trees with disjoint dominating and 2-dominating sets

Cites Work

• On the minimum diameter spanning tree problem
• A note on graphs with diameter-preserving spanning trees
• Minimum Diameter Spanning Trees and Related Problems
• Unnamed Item

This page was built for publication: Diameter-preserving spanning trees in sparse weighted graphs