The following pages link to Spanners of bounded degree graphs (Q1944059):
Displaying 11 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- Spanners in Sparse Graphs (Q3521950) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)
