A self-stabilizing algorithm for maximal matching

A self-stabilizing algorithm for maximal matching

We present a self-stabilizing algorithm for finding a maximal matching in distributed networks. Due to its self-stabilizing property, the algorithm can automatically detect and recover from the faults caused by unexpected perturbations on local variables maintained on each node of the system. A vari...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1992-08, Vol.43 (2), p.77-81
Hauptverfasser: Hsu, Su-Chu, Huang, Shing-Tsaan
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Distributed systems
Exact sciences and technology
Fault tolerance
Functions
Information processing
maximal matching
self-stabilization
Software
Theory
variant function
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a self-stabilizing algorithm for finding a maximal matching in distributed networks. Due to its self-stabilizing property, the algorithm can automatically detect and recover from the faults caused by unexpected perturbations on local variables maintained on each node of the system. A variant function is provided to prove the correctness of the algorithm and to analyze its time complexity.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(92)90015-N