Collective Additive Tree Spanners of Homogeneously Orderable Graphs

DOI10.1007/978-3-540-78773-0_48zbMath1136.68457OpenAlexW1517810623MaRDI QIDQ5458559

Feodor F. Dragan, Yang Xiang, Chenyu Yan

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_48

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Homogeneously orderable graphs
• A Separator Theorem for Chordal Graphs
• Dually Chordal Graphs
• Distance Approximating Trees for Chordal and Dually Chordal Graphs
• Graph Classes: A Survey
• r-domination problems on homogeneously orderable graphs
• Distributed Computing: A Locality-Sensitive Approach
• Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
• Tree Spanners
• Distance approximating spanning trees
• Additive graph spanners
• Collective Tree Spanners and Routing in AT-free Related Graphs
• Collective tree spanners of graphs
• Graph-Theoretic Concepts in Computer Science
• Algorithms and Computation
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Collective Additive Tree Spanners of Homogeneously Orderable Graphs