Pages that link to "Item:Q3642863"
From MaRDI portal
The following pages link to Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs (Q3642863):
Displaying 13 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)
- Spanners in sparse graphs (Q657919) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6670816) (← links)
