A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph

DOI10.1016/S0898-1221(98)00068-6zbMath0999.05091MaRDI QIDQ1608394

Pradip K. Srimani, Gheorghe Antonoiu

Publication date: 6 August 2002

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

zbMATH Keywords

correctnessspanning treeself-stabilizing distributed algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph

Cites Work

• Stabilizing unison
• A belated proof of self-stabilization
• A self-stabilizing algorithm for constructing spanning trees
• A self-stabilizing algorithm for constructing breadth-first trees
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• Self-stabilizing systems in spite of distributed control
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
• Token systems that self-stabilize

This page was built for publication: A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph