The following pages link to Spanners in sparse graphs (Q657919):
Displayed 8 items.
- 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)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6091160) (← links)
- Tree 3-spanners on generalized prisms of graphs (Q6109031) (← links)