Pages that link to "Item:Q2370441"
From MaRDI portal
The following pages link to Tree-decompositions with bags of small diameter (Q2370441):
Displaying 37 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Connected tree-width (Q722321) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- Tree-length equals branch-length (Q1044006) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Additive tree \(O(\rho \log n)\)-spanners from tree breadth \(\rho \) (Q2124229) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- On the Tree-Width of Planar Graphs (Q2851524) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Burning Two Worlds (Q3297761) (← links)
- Control of Some Graph Invariants in Dynamic Routing (Q3627672) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- A survey of graph burning (Q4986283) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
