Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
From MaRDI portal
Publication:2253192
Recommendations
Cites work
- scientific article; zbMATH DE number 1670859 (Why is no real title available?)
- scientific article; zbMATH DE number 1375574 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2038725 (Why is no real title available?)
- scientific article; zbMATH DE number 1559591 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- scientific article; zbMATH DE number 1929927 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- (1 + εΒ) -spanner constructions for general graphs
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
- A Separator Theorem for Chordal Graphs
- A tight bound on approximating arbitrary metrics by tree metrics
- Additive Tree Spanners
- Additive graph spanners
- Additive spanners in nearly quadratic time
- All-Pairs Almost Shortest Paths
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- An Optimal Synchronizer for the Hypercube
- Approximate distance oracles
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
- Approximating \(k\)-spanner problems for \(k>2\)
- Approximation of minimum weight spanners for sparse graphs
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
- Collective Tree Spanners and Routing in AT-free Related Graphs
- Collective tree spanners in graphs with bounded parameters
- Collective tree spanners of graphs
- Compact and low delay routing labeling scheme for unit disk graphs
- Directed spanners via flow-based linear programs
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- Distance approximating spanning trees
- Dynamic analysis of the arrow distributed protocol
- Generating Sparse 2-Spanners
- Graph minors. II. Algorithmic aspects of tree-width
- Graph spanners
- Graph-Theoretic Concepts in Computer Science
- Improved approximation for the directed spanner problem
- Label cover instances with large girth and the hardness of approximating basic \(k\)-spanner
- Low complexity variants of the arrow distributed directory
- Lower-Stretch Spanning Trees
- New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
- On sparse spanners of weighted graphs
- On the Desirability of Acyclic Database Schemes
- On the complexity of computing treelength
- On the hardness of approximating spanners
- Spanners for bounded tree-length graphs
- Spanners in sparse graphs
- Spanners of bounded degree graphs
- The geometry of graphs and some of its algorithmic applications
- The hardness of approximating spanner problems
- The zoo of tree spanner problems
- There are planar graphs almost as good as the complete graph
- Transitive-closure spanners
- Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
- Tree Spanners
- Tree spanners for bipartite graphs and probe interval graphs
- Tree spanners in planar graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Tree-decompositions with bags of small diameter
Cited in
(12)- Easy computation of eccentricity approximating trees
- Collective tree spanners in graphs with bounded parameters
- Algorithm Theory - SWAT 2004
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \)
- On the complexity of computing treebreadth
- Collective additive tree spanners for circle graphs and polygonal graphs
- Additive Spanners for Circle Graphs and Polygonal Graphs
- Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
- Covering metric spaces by few trees
- Collective tree spanners for unit disk graphs with applications
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Algorithms and Computation
This page was built for publication: Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253192)
