Analysis of a memory-efficient self-stabilizing BFS spanning tree construction

DOI10.1016/j.tcs.2023.113804OpenAlexW4324387335MaRDI QIDQ2697434

Ajoy K. Datta, Colette Johnen, Stéphane Devismes, Lawrence L. Larmore

Publication date: 12 April 2023

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

Full work available at URL: https://arxiv.org/abs/1907.07944

zbMATH Keywords

self-stabilizationround complexitystabilization timeBFS spanning treedistributed unfair daemon

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A self-stabilizing algorithm for constructing spanning trees
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing depth-first search
• Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
• Memory requirements for silent stabilization
• The first fully polynomial stabilizing algorithm for BFS tree construction
• The Conic toolkit for building distributed systems
• Self-stabilizing systems in spite of distributed control
• Introduction to Distributed Self-Stabilizing Algorithms

This page was built for publication: Analysis of a memory-efficient self-stabilizing BFS spanning tree construction