A self-stabilizing algorithm for constructing spanning trees

A self-stabilizing algorithm is proposed for constructing spanning trees for connected graphs. Because of the self-stabilizing property, the algorithm can handle error recovery automatically.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters 1991-08, Vol.39 (3), p.147-151
Hauptverfasser:	Chen, Nian-Shing, Yu, Hwey-Pyng, Huang, Shing-Tsaan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Analysis of algorithms Applied sciences combinatorial problems Computer science control theory systems design of algorithms Exact sciences and technology Fault tolerance Information processing self-stabilizing spanning tree Theoretical computing Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A self-stabilizing algorithm is proposed for constructing spanning trees for connected graphs. Because of the self-stabilizing property, the algorithm can handle error recovery automatically.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/0020-0190(91)90111-T