The following pages link to Spanners in Sparse Graphs (Q3521950):
Displaying 21 items.
- Spanning with indexes (Q406270) (← links)
- Sparsity. Graphs, structures, and algorithms (Q419416) (← links)
- Sparse halves in dense triangle-free graphs (Q490981) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- On Pairwise Spanners (Q2957885) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- Relaxed Spanners for Directed Disk Graphs (Q3113784) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Spanners for Geometric Intersection Graphs (Q3603536) (← links)
- Graph spanners (Q3826599) (← links)
- (Q4246748) (← links)
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS (Q4698355) (← links)
- Additive graph spanners (Q5289379) (← links)
- (Q5743379) (← links)