Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A self-stabilizing algorithm for maximal matching
Information Processing Letters
Maximal matching stabilizes in quadratic time
Information Processing Letters
Self-stabilization
Maximal matching stabilizes in time O(m)
Information Processing Letters
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Brief announcement: self-stabilizing distance-d distinct labels via enriched fair composition
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Kinetically stable task assignment for networks of microservers
Proceedings of the 5th international conference on Information processing in sensor networks
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
Journal of Parallel and Distributed Computing
Distributed edge coloration for bipartite networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A new self-stabilizing maximal matching algorithm
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A self-stabilizing weighted matching algorithm
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
An application of snap-stabilization: matching in bipartite graphs
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Approximation of self-stabilizing vertex cover less than 2
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Benchmarking Peer-to-Peer Systems
| Hi-index | 0.00 |
Finding a maximal or maximum matching in a graph is a well-understood problem for which efficient sequential algorithms exist. Applications of matchings in distributed settings make it desirable to find self-stabilizing asynchronous distributed solutions to these problems. We first present a self-stabilizing algorithm for finding a maximal matching in a general anonymous network under read/write atomicity with linear round complexity. This is followed by a self-stabilizing algorithm, with quadratic time complexity, for finding a maximum matching in a bipartite network under composite atomicity. These results represent significant progress in the area of distributed algorithms for matchings.