Spanners of Complete k-Partite Geometric Graphs
From MaRDI portal
Publication:5458526
DOI10.1007/978-3-540-78773-0_15zbMath1136.68449MaRDI QIDQ5458526
Anil Maheshwari, Prosenjit Bose, Pat Morin, Paz Carmi, Mathieu Couture, Michiel H. M. Smid
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_15
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On the power of the semi-separated pair decomposition, On the Power of the Semi-Separated Pair Decomposition
Cites Work
- Unnamed Item
- On sparse spanners of weighted graphs
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions
- Geometric Spanner Networks
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- On Spanners of Geometric Graphs