A new polynomial silent stabilizing spanning-tree construction algorithm

DOI10.1007/978-3-642-11476-2_12MaRDI QIDQ3408166zbMATHOpenAlexFDO

Authors 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

fault-tolerancestabilizationdistributed systemssilent algorithmsspanning-tree construction

Mathematics Subject Classification ID

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

Recommendations

• Parallel Processing and Applied Mathematics
• The first fully polynomial stabilizing algorithm for BFS tree construction
• The first fully polynomial stabilizing algorithm for BFS tree construction
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• Memory requirements for silent stabilization

Cites work

• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• A Snap-Stabilizing DFS with a Lower Space Requirement
• A self-stabilizing algorithm for constructing breadth-first trees
• A self-stabilizing algorithm for constructing spanning trees
• Distributed reset
• Introduction to Distributed Algorithms
• Parallel Processing and Applied Mathematics
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing systems in spite of distributed control
• Snap-stabilization and PIF in tree networks
• Time Optimal Asynchronous Self-stabilizing Spanning Tree

Cited in

(6)

• Parallel Processing and Applied Mathematics
• Acyclic strategy for silent self-stabilization in spanning forests
• The first fully polynomial stabilizing algorithm for BFS tree construction
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• The first fully polynomial stabilizing algorithm for BFS tree construction
• Optimized silent self-stabilizing scheme for tree-based constructions

This page was built for publication: A new polynomial silent stabilizing spanning-tree construction algorithm

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