A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net
Computing - 2002
Tóm tắt
corresponding to an undirected biconnected graph on a distributed or network model of computation. The algorithm is resilient to transient faults and does not require initialization. In addition, it is capable of handling topology changes in a transient manner. The paper includes a correctness proof of the algorithm. Finally, it concludes with some final remarks.