Spanners for bounded tree-length graphs
From MaRDI portal
Publication:2383601
Recommendations
Cites work
- (1 + εΒ) -spanner constructions for general graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A note on distance approximating trees in graphs
- A trade-off between space and efficiency for routing tables
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Additive Tree Spanners
- Algorithm Theory - SWAT 2004
- Algorithms for maximum weight induced paths
- All-Pairs Almost Shortest Paths
- An Optimal Synchronizer for the Hypercube
- Approximate distance oracles
- Design networks with bounded pairwise distance
- Distributed Computing: A Locality-Sensitive Approach
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Graph minors. II. Algorithmic aspects of tree-width
- Graph spanners
- scientific article; zbMATH DE number 434498 (Why is no real title available?)
- scientific article; zbMATH DE number 1375574 (Why is no real title available?)
- scientific article; zbMATH DE number 2038725 (Why is no real title available?)
- scientific article; zbMATH DE number 1875437 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
- On sparse spanners of weighted graphs
- Structural Information and Communication Complexity
- The Moore bound for irregular graphs
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- Tree Spanners
- Tree spanners in planar graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Tree-decompositions with bags of small diameter
Cited in
(17)- Tree-length equals branch-length
- On the complexity of computing treebreadth
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Tree-decompositions with bags of small diameter
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- On approximating tree spanners that are breadth first search trees
- On the complexity of computing treebreadth
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- scientific article; zbMATH DE number 2011848 (Why is no real title available?)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Structural Information and Communication Complexity
- Tree spanners in planar graphs
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- Tree spanners for bipartite graphs and probe interval graphs
- On the complexity of computing treelength
This page was built for publication: Spanners for bounded tree-length graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383601)
