A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time

Authors:
Wayne Goddard;Stephen T. Hedetniemi;David P. Jacobs;Pradip K. Srimani
Affiliations:
-;-;-;-
Venue:
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Year:
2003

Citing 0
Cited 2

A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs

Journal of Parallel and Distributed Computing
Self-stabilizing algorithm for maximal graph partitioning into triangles

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a self-stabilizing algorithm for .nding a generalized maximal matching (b-matching) in an arbitrary distributed network. We show that the algorithm converges in 0(m) moves under an unfair central demon independent of the b-values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].