The following pages link to Graph spanners (Q3826599):
Displaying 50 items.
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- Spanners of underlying graphs of iterated line digraphs (Q287078) (← links)
- On resilient graph spanners (Q289925) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- Spanders: distributed spanning expanders (Q395654) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Sparse reliable graph backbones (Q418121) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Angle-constrained spanners with angle at least \(\pi/3\) (Q506169) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← 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)
- Geometric spanners with applications in wireless networks (Q868107) (← links)
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
- Networks with small stretch number (Q876723) (← links)
- Computing the greedy spanner in linear space (Q893321) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- On 2-detour subgraphs of the hypercube (Q1014814) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Edge-disjoint spanners in tori (Q1025482) (← links)
- Classes of graphs which approximate the complete Euclidean graph (Q1186079) (← links)
- On sparse spanners of weighted graphs (Q1196368) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- NP-completeness of minimum spanner problems (Q1315465) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (Q1331949) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Sparse hypercube 3-spanners (Q1570842) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- New pairwise spanners (Q1693988) (← links)
- NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
- (\(k,+\))-distance-hereditary graphs (Q1827274) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Degree-constrained spanners for multidimensional grids (Q1917351) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Making asynchronous distributed computations robust to noise (Q2010600) (← links)
