A self-stabilizing algorithm for maximal matching
Information Processing Letters
Maximal matching stabilizes in quadratic time
Information Processing Letters
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Maximal matching stabilizes in time O(m)
Information Processing Letters
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Efficient Self-stabilizing Algorithms for Tree Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Distance- k knowledge in self-stabilizing algorithms
Theoretical Computer Science
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 5.23 |
The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and the self-stabilizing literature. Previous work has resulted in self-stabilizing algorithms for computing a maximal (12-approximation) matching in a general graph, as well as computing a 23-approximation on more specific graph types. In this paper, we present the first self-stabilizing algorithm for finding a 23-approximation to the maximum matching problem in a general graph. We show that our new algorithm, when run under a distributed adversarial daemon, stabilizes after at most O(n^2) rounds. However, it might still use an exponential number of time steps.