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
Dynamic and self-stabilizing distributed matching
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
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
A self-stabilizing weighted matching algorithm
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
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
Introducing speculation in self-stabilization: an application to mutual exclusion
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 5.23 |
The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given several self-stabilizing algorithms that solve the problem for both the adversarial and the fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it has the same time complexity as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best time complexities for the distributed adversarial daemon from O(n^2) and O(@dm) to O(m) where n is the number of processes, m is the number of edges, and @d is the maximum degree in the graph.