Time Optimal Asynchronous Self-stabilizing Spanning Tree

DOI10.1007/978-3-540-75142-7_10zbMath1145.68346OpenAlexW4212794548MaRDI QIDQ3523201

Shay Kutten, Janna Burman

Publication date: 2 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_10

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (10)

Distributed edge coloration for bipartite networks ⋮ Maintaining balanced trees for structured distributed streaming systems ⋮ A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees ⋮ Self-stabilizing minimum degree spanning tree within one from the optimal degree ⋮ Maximum metric spanning tree made Byzantine tolerant ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ Self-stabilizing leader election in polynomial steps ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm ⋮ Near-optimal knowledge-free resilient leader election

This page was built for publication: Time Optimal Asynchronous Self-stabilizing Spanning Tree