A new polynomial silent stabilizing spanning-tree construction algorithm

DOI10.1007/978-3-642-11476-2_12zbMATH Open1274.68021OpenAlexW1590408470MaRDI QIDQ3408166FDOQ3408166

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

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

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)

Cites Work

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

Cited In (5)

• 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
• Parallel Processing and Applied Mathematics
• 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)