A Self-stabilizing and Local Delaunay Graph Construction
From MaRDI portal
Publication:3652263
DOI10.1007/978-3-642-10631-6_78zbMath1273.68277OpenAlexW127958605MaRDI QIDQ3652263
Stefan Schmid, Stephan Ritscher, Riko Jacob, Christian Scheideler
Publication date: 17 December 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_78
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14)
Related Items (11)
A self-stabilizing Hashed Patricia Trie ⋮ Towards worst-case churn resistant peer-to-peer systems ⋮ Corona: a stabilizing deterministic message-passing skip list ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Re-Chord: a self-stabilizing chord overlay network ⋮ Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs ⋮ SKIP + ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ Self-adjusting grid networks to minimize expected path length ⋮ Self-adjusting Grid Networks to Minimize Expected Path Length ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
This page was built for publication: A Self-stabilizing and Local Delaunay Graph Construction
