A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph

DOI10.1016/0898-1221(95)00143-MzbMath0835.68087MaRDI QIDQ1903205

Pradip K. Srimani, Gheorghe Antonoiu

Publication date: 11 January 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

spanning treeconnected graphself-stabilizing distributed algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (3)

An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity ⋮ Self-stabilizing algorithms for minimal dominating sets and maximal independent sets ⋮ A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph

Cites Work

• Stabilizing unison
• A belated proof of self-stabilization
• An exercise in proving self-stabilization with a variant function
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilizing systems in spite of distributed control
• Token systems that self-stabilize

This page was built for publication: A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph