Time complexity of distributed topological self-stabilization: the case of graph linearization

DOI10.1007/978-3-642-12200-2_27MaRDI QIDQ3557028zbMATH OpenOpenAlexFDO

Authors Dominik Gall, Riko Jacob, Stefan Schmid, Hanjo Täubig, Andrea 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A note on the parallel runtime of self-stabilizing graph linearization
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
• Topological Self-Stabilization with Name-Passing Process Calculi
• SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
• A self-stabilizing and local Delaunay graph construction

Cited in

(8)

• Corona: a stabilizing deterministic message-passing skip list
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
• 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
• Linearization: locally self-stabilizing sorting in graphs
• Re-Chord: a self-stabilizing chord overlay network

This page was built for publication: Time complexity of distributed topological self-stabilization: the case of graph linearization

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