Collective Additive Tree Spanners of Homogeneously Orderable Graphs
From MaRDI portal
Recommendations
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
- Collective additive tree spanners for circle graphs and polygonal graphs
- Collective tree spanners of graphs
- Algorithm Theory - SWAT 2004
- Collective tree spanners in graphs with bounded parameters
- Algorithms and Computation
- Structural Information and Communication Complexity
- Collective tree spanners for unit disk graphs with applications
- Additive tree 2-spanners of permutation graphs
Cites work
- A Separator Theorem for Chordal Graphs
- A tight bound on approximating arbitrary metrics by tree metrics
- Additive graph spanners
- Algorithms and Computation
- Collective Tree Spanners and Routing in AT-free Related Graphs
- Collective tree spanners of graphs
- Distance approximating spanning trees
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- Distributed Computing: A Locality-Sensitive Approach
- Dually Chordal Graphs
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- Homogeneously orderable graphs
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- r-domination problems on homogeneously orderable graphs
- Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
- Tree Spanners
Cited in
(2)
This page was built for publication: Collective Additive Tree Spanners of Homogeneously Orderable Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458559)
