We present a self-stabilizing algorithm for finding a generalized maximal matching (b-matching) in an arbitrary distributed network. We show that the algorithm converges in O(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].
['Wayne Goddard', 'Stephen T. Hedetniemi', 'David Pokrass Jacobs', 'Pradip K. Srimani']
A robust distributed generalized matching protocol that stabilizes in linear time