Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
From MaRDI portal
Publication:3557028
DOI10.1007/978-3-642-12200-2_27zbMath1283.68397OpenAlexW2118184224MaRDI QIDQ3557028
Riko Jacob, Dominik Gall, Stefan Schmid, Hanjo Täubig, Andréa W. Richa, Christian Scheideler
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_27
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (6)
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 ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs ⋮ Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
This page was built for publication: Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
