The first fully polynomial stabilizing algorithm for BFS tree construction

DOI10.1007/978-3-642-25873-2_12MaRDI QIDQ2900969zbMATH OpenOpenAlexFDO

Authors Alain Cournier, Stephane Rovedakis, Vincent Villain

Publication date 27 July 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

fault-tolerancestabilizationdistributed systemsspanning tree construction

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• 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
• A new polynomial silent stabilizing spanning-tree construction algorithm
• Space efficient and time optimal distributed BFS tree construction
• Parallel Processing and Applied Mathematics

Cited in

(7)

• A new polynomial silent stabilizing spanning-tree construction algorithm
• An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
• Space efficient and time optimal distributed BFS tree construction
• The first fully polynomial stabilizing algorithm for BFS tree construction
• Optimized silent self-stabilizing scheme for tree-based constructions
• Analysis of a memory-efficient self-stabilizing BFS spanning tree construction
• Self-stabilizing silent disjunction in an anonymous network

This page was built for publication: The first fully polynomial stabilizing algorithm for BFS tree construction

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