The following pages link to Tree spanners in planar graphs (Q5928870):
Displaying 39 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Spanning tree congestion of planar graphs (Q394137) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← 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)
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Classes of cycle bases (Q868389) (← links)
- Tree spanners for bipartite graphs and probe interval graphs (Q868437) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- Network flow spanners (Q3057178) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- (Q4273851) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6670816) (← links)
