Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs

DOI10.1016/j.tcs.2012.07.029zbMath1284.68072OpenAlexW2163818815MaRDI QIDQ714851

Riko Jacob, Stefan Schmid, Stephan Ritscher, Christian Scheideler

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.029

zbMATH Keywords

social networksdistributed algorithmstopology control

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

A note on the parallel runtime of self-stabilizing graph linearization ⋮ Towards a universal approach for the finite departure problem in overlay networks ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks ⋮ On the Complexity of Local Graph Transformations

Uses Software

• Chord

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Building self-stabilizing overlay networks with the transitive closure framework
• 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
• Communication-Efficient Construction of the Plane Localized Delaunay Graph
• Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
• A Self-stabilizing and Local Delaunay Graph Construction
• Self-stabilizing systems in spite of distributed control
• Topology control for multihop packet radio networks
• Online Routing in Triangulations
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Principles of Distributed Systems

This page was built for publication: Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs