The following pages link to Generating Low-Degree 2-Spanners (Q4210117):
Displaying 16 items.
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Bounded degree spanners of the hypercube (Q782941) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Edge-disjoint spanners in tori (Q1025482) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Local heuristics and the emergence of spanning subgraphs in complex networks (Q2368968) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- Lowest-degree \(k\)-spanner: approximation and hardness (Q2830866) (← links)
- Spanners in graphs of bounded degree (Q4303628) (← links)
- Generating Sparse 2-Spanners (Q4312222) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Generating sparse 2—spanners (Q5056130) (← links)
- (Q5091190) (← links)
- On the hardness of approximating spanners (Q5945922) (← links)
- (Q6065466) (← links)