Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph

Abstract

We present a new self-stabilizing algorithm for finding a maximal strong matching in an arbitrary distributed network. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1,2]. The concepts behind the algorithm, using Ids in the newtork, promise to have applications for other graph theoretic primitives.

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

“…Goddard et al [21] proposed an algorithm to find a maximal strong matching, where a matching is called strong if every matched node is adjacent to only one matched node. Another algorithm has been proposed by Manne and Mjelde [52] for the weighted matching problem.…”

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs

“…We use the standard shared-variable model [17], in which a node sees the variables of its neighbors; this is the same model that has been used in earlier self-stabilizing protocol design. Since our objective is to explore the algorithmic aspects distributed protocols based on local 1 A preliminary version of the total domination algorithm was presented in [12] 2 A preliminary version was presented in [29] 332 Srimani et al…”