Diameter-preserving spanning trees in sparse weighted graphs

DOI10.1007/S00373-010-0887-ZMaRDI QIDQ968216zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Existence of a spanning tree having small diameter
• A note on graphs with diameter-preserving spanning trees
• Spanning trees with small diameters
• Minimum Diameter Spanning Trees and Related Problems
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS

Cites work

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

Cited in

(6)

• A cooperative location game based on the 1-center location problem
• Spanning trees with disjoint dominating and 2-dominating sets
• scientific article; zbMATH DE number 4010534 (Why is no real title available?)
• Degree-preserving spanning trees in small-degree graphs
• scientific article; zbMATH DE number 10563 (Why is no real title available?)
• A note on graphs with diameter-preserving spanning trees

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

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