The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction

DOI10.1007/978-3-642-25873-2_12zbMath1430.68436OpenAlexW1745087894MaRDI QIDQ2900969

Stephane Rovedakis, Alain Cournier, 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

stabilizationdistributed systemsfault-tolerancespanning tree construction

Mathematics Subject Classification ID

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

Related Items (4)

An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ 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: The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction