Generating sparse 2—spanners
From MaRDI portal
Publication:5056130
DOI10.1007/3-540-55706-7_7zbMath1502.68237MaRDI QIDQ5056130
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_7
68R10: Graph theory (including graph drawing) in computer science
68W25: Approximation algorithms
05C40: Connectivity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Delaunay graphs are almost as good as complete graphs
- Graph spanners
- Near-Linear Time Construction of Sparse Neighborhood Covers
- An Optimal Synchronizer for the Hypercube
- Generating sparse spanners for weighted graphs
- Low-diameter graph decomposition is in NC
- Grid spanners
- Fast network decomposition