Pages that link to "Item:Q2383601"
From MaRDI portal
The following pages link to Spanners for bounded tree-length graphs (Q2383601):
Displaying 17 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- Tree-length equals branch-length (Q1044006) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \) (Q2124229) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Structural Information and Communication Complexity (Q5315220) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- Tree spanners in planar graphs (Q5928870) (← links)
