When graph theory helps self-stabilization
From MaRDI portal
Publication:5501494
DOI10.1145/1011767.1011790zbMath1321.68065OpenAlexW2056209062MaRDI QIDQ5501494
Christian Boulinier, Vincent Villain, Franck Petit
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011790
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ Rooted Cycle Bases ⋮ Global Synchronization of Pulse-Coupled Oscillators on Trees ⋮ Neighborhood mutual remainder: self-stabilizing distributed implementation and applications ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ Self-stabilizing Byzantine asynchronous unison ⋮ Synchronous vs. asynchronous unison ⋮ Distance-\(k\) knowledge in self-stabilizing algorithms ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Dynamic FTSS in asynchronous systems: the case of unison ⋮ Snap-Stabilizing Waves in Anonymous Networks ⋮ Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples ⋮ Stabilizing mobile philosophers ⋮ Self-stabilizing distributed algorithm for local mutual inclusion ⋮ On probabilistic snap-stabilization
