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

DOI10.1016/J.TCS.2012.07.029MaRDI QIDQ714851zbMATH OpenOpenAlexFDO

Authors Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid

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 algorithms (68W15) Distributed systems (68M14)

Recommendations

• A self-stabilizing and local Delaunay graph construction
• Time complexity of distributed topological self-stabilization: the case of graph linearization
• A note on the parallel runtime of self-stabilizing graph linearization
• Topological Self-Stabilization with Name-Passing Process Calculi
• A dynamic self-stabilizing algorithm for constructing a transport net

Cites work

• scientific article; zbMATH DE number 1332668 (Why is no real title available?)
• scientific article; zbMATH DE number 1049272 (Why is no real title available?)
• scientific article; zbMATH DE number 3016052 (Why is no real title available?)
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• A self-stabilizing and local Delaunay graph construction
• Building self-stabilizing overlay networks with the transitive closure framework
• Communication-efficient construction of the plane localized Delaunay graph
• Computational geometry. Algorithms and applications.
• Corona: a stabilizing deterministic message-passing skip list
• Online Routing in Triangulations
• Principles of Distributed Systems
• Re-Chord: a self-stabilizing chord overlay network
• Self-stabilizing systems in spite of distributed control
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Time complexity of distributed topological self-stabilization: the case of graph linearization
• Topology control for multihop packet radio networks

Cited in

(7)

• Towards a universal approach for the finite departure problem in overlay networks
• Towards a universal approach for the finite departure problem in overlay networks
• A note on the parallel runtime of self-stabilizing graph linearization
• A self-stabilizing and local Delaunay graph construction
• Time complexity of distributed topological self-stabilization: the case of graph linearization
• Efficient, Decentralized Computation of the Topology of Spatial Regions
• On the Complexity of Local Graph Transformations

Describes a project that uses

Uses Software

• Chord

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714851)