The following pages link to Additive Tree Spanners (Q4443141):
Displaying 21 items.
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- On 2-detour subgraphs of the hypercube (Q1014814) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Easy computation of eccentricity approximating trees (Q1741520) (← 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)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- Eccentricity approximating trees (Q2410233) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- Eccentricity Approximating Trees (Q3181054) (← links)
- Additive tree 2-spanners of permutation graphs (Q3396414) (← links)
- A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph (Q3545835) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Bounded-diameter tree-decompositions (Q6548028) (← links)
