Communication-Efficient Construction of the Plane Localized Delaunay Graph

DOI10.1007/978-3-642-12200-2_26zbMath1283.05255arXiv0809.2956OpenAlexW1717998847MaRDI QIDQ3557027

Daming Xu, Prosenjit Bose, Paz Carmi, Michiel H. M. Smid

Publication date: 27 April 2010

Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.2956

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On plane geometric spanners: a survey and open problems ⋮ The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition ⋮ Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions ⋮ Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs

This page was built for publication: Communication-Efficient Construction of the Plane Localized Delaunay Graph