Fast Self-stabilizing Minimum Spanning Tree Construction

DOI10.1007/978-3-642-15763-9_46zbMath1290.68129arXiv1311.0798OpenAlexW1889166093MaRDI QIDQ3588324

Stephane Rovedakis, Shlomi Dolev, Lélia Blin, Maria Gradinariu Potop-Butucaru

Publication date: 10 September 2010

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

Full work available at URL: https://arxiv.org/abs/1311.0798

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (4)

Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery ⋮ A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs

This page was built for publication: Fast Self-stabilizing Minimum Spanning Tree Construction