A self-stabilizing algorithm for maximal matching
Information Processing Letters
Maximal matching stabilizes in quadratic time
Information Processing Letters
Self-stabilization
Self-Stabilizing Strong Fairness under Weak Fairness
IEEE Transactions on Parallel and Distributed Systems
Maximal matching stabilizes in time O(m)
Information Processing Letters
Dynamic and self-stabilizing distributed matching
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Distributed approximation: a survey
ACM SIGACT News
A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination*
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Information Processing Letters
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Local, distributed weighted matching on general and wireless topologies
Proceedings of the fifth international workshop on Foundations of mobile computing
Fault tolerance in wireless sensor networks through self-stabilisation
International Journal of Communication Networks and Distributed Systems
A Self-stabilizing $\frac{2}{3}$-Approximation Algorithm for the Maximum Matching Problem
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
Distributed Approximate Matching
SIAM Journal on Computing
Journal of Parallel and Distributed Computing
Self-stabilizing device drivers
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A self-stabilizing weighted matching algorithm
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 5.23 |
The maximum weight matching problem is a fundamental problem in graph theory with a variety of important applications. Recently Manne and Mjelde presented the first self-stabilizing algorithm computing a 2-approximation of the optimal solution. They established that their algorithm stabilizes after O(2^n) (resp. O(3^n)) moves under a central (resp. distributed) scheduler. This paper contributes a new analysis, improving these bounds considerably. In particular it is shown that the algorithm stabilizes after O(nm) moves under the central scheduler and that a modified version of the algorithm also stabilizes after O(nm) moves under the distributed scheduler. The paper presents a new proof technique based on graph reduction for analyzing the complexity of self-stabilizing algorithms.