The following pages link to Additive graph spanners (Q5289379):
Displaying 31 items.
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Spanners of underlying graphs of iterated line digraphs (Q287078) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Bounded degree spanners of the hypercube (Q782941) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- A distance approximating trees (Q948693) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- On 2-detour subgraphs of the hypercube (Q1014814) (← links)
- Edge-disjoint spanners in tori (Q1025482) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Degree-constrained spanners for multidimensional grids (Q1917351) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Sparsification lower bound for linear spanners in directed graphs (Q2055974) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- Network flow spanners (Q3057178) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- Additive tree 2-spanners of permutation graphs (Q3396414) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- Distance approximating spanning trees (Q5048949) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- Parameterized Complexity of Directed Spanner Problems. (Q6089656) (← links)
