A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm

DOI10.1007/978-3-642-11476-2_12zbMath1274.68021OpenAlexW1590408470MaRDI QIDQ3408166

Alain Cournier

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11476-2_12

zbMATH Keywords

stabilizationdistributed systemsfault-tolerancesilent algorithmsspanning-tree construction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items

The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ Optimized silent self-stabilizing scheme for tree-based constructions

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
• Snap-stabilization and PIF in tree networks
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Self-stabilizing systems in spite of distributed control
• Distributed reset
• Introduction to Distributed Algorithms
• A Snap-Stabilizing DFS with a Lower Space Requirement
• Parallel Processing and Applied Mathematics