A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property

DOI10.1007/978-3-642-04355-0_43zbMath1261.68162arXiv0905.2287OpenAlexW1854762352MaRDI QIDQ3646240

Sébastien Tixeuil, Lélia Blin, Stephane Rovedakis, Maria Gradinariu Potop-Butucaru

Publication date: 19 November 2009

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

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (3)

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Optimized silent self-stabilizing scheme for tree-based constructions

This page was built for publication: A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property