The following pages link to Spanners in sparse graphs (Q657919):
Displaying 22 items.
- Spanning with indexes (Q406270) (← links)
- Sparsity. Graphs, structures, and algorithms (Q419416) (← 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)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← 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)
- 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)
- On Pairwise Spanners (Q2957885) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Relaxed Spanners for Directed Disk Graphs (Q3113784) (← links)
- Spanners in Sparse Graphs (Q3521950) (← links)
- Spanners for Geometric Intersection Graphs (Q3603536) (← links)
- Graph spanners (Q3826599) (← links)
- (Q4246748) (← links)
- Almost All Even Yao-Yao Graphs Are Spanners (Q4606334) (← links)
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS (Q4698355) (← links)
- Additive graph spanners (Q5289379) (← links)
- Polynomial algorithms for sparse spanners on subcubic graphs (Q6621853) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6670816) (← links)
