A distance approximating trees

DOI10.1016/J.DAM.2007.11.012MaRDI QIDQ948693zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 17 October 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.11.012

zbMATH Keywords

tree spannerdistance approximating trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12)

Recommendations

• Distance Approximating Trees: Complexity and Algorithms
• A note on distance approximating trees in graphs
• Distance approximating spanning trees
• Distance approximating trees in graphs
• scientific article; zbMATH DE number 890671

Cites work

• scientific article; zbMATH DE number 1375574 (Why is no real title available?)
• A note on distance approximating trees in graphs
• Additive graph spanners
• Distance Approximating Trees for Chordal and Dually Chordal Graphs
• Distance Approximating Trees: Complexity and Algorithms
• Distance approximating spanning trees
• Parallel concepts in graph theory
• Tree Spanners

Cited in

(10)

• A note on distance approximating trees in graphs
• The proportion of trees that are linear
• scientific article; zbMATH DE number 4047157 (Why is no real title available?)
• scientific article; zbMATH DE number 508964 (Why is no real title available?)
• Approximation algorithms for approximating graphs with bounded number of connected components
• Distance Approximating Trees: Complexity and Algorithms
• Some results about the inset edge and average distance of trees
• Distance approximating trees in graphs
• Distance approximating spanning trees
• Distances between rooted trees

This page was built for publication: A distance approximating trees

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