| Article ID: | iaor1999323 |
| Country: | United Kingdom |
| Volume: | 35 |
| Issue: | 10 |
| Start Page Number: | 15 |
| End Page Number: | 23 |
| Publication Date: | May 1998 |
| Journal: | Computers & Mathematics with Applications |
| Authors: | Srimani P.K., Antonoiu G. |
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove its correctness. We show the correctness of the proposed algorithm by using a new technique involving induction.