The following pages link to Graph spanners: a tutorial review (Q2026289):
Displaying 12 items.
- Bounded degree spanners of the hypercube (Q782941) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- A note on distance-preserving graph sparsification (Q2059887) (← links)
- Spanners in randomly weighted graphs: independent edge lengths (Q2065765) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Minimum \(t\)-spanners on subcubic graphs (Q2154116) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- Spanners in randomly weighted graphs: Euclidean case (Q6047967) (← links)
- Blackout-tolerant temporal spanners (Q6141041) (← links)
