Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Token Systems That Self-Stabilize
IEEE Transactions on Computers
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
SIAM Journal on Computing
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
Self-Stabilizing Strong Fairness under Weak Fairness
IEEE Transactions on Parallel and Distributed Systems
Dynamic and self-stabilizing distributed matching
Proceedings of the twenty-first annual symposium on Principles of distributed computing
IEEE Transactions on Computers
A stabilizing algorithm for finding biconnected components
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Stabilization-Preserving Atomicity Refinement
Proceedings of the 13th International Symposium on Distributed Computing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
A self-stabilizing algorithm for bridge finding
Distributed Computing
Self-stabilizing depth-first token circulation in arbitrary rooted networks
Distributed Computing
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Self-stabilizing depth-first token circulation on networks
Distributed Computing - Special issue: Self-stabilization
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
A matching M of graph G = (V, E) is a subset of the edges E, such that no vertex in V is incident to more than one edge in M. The matching M is maximum if there is no matching in G with size strictly larger than the size of M. In this paper, we present a distributed stabilizing algorithm for finding maximum matching in bipartite graphs based on the stabilizing PIF algorithm of [8]. Since our algorithm is stabilizing, it does not require initialization and withstands transient faults. The complexity of the proposed algorithm is O(d×n) rounds, where d is the diameter of the communication network and n is the number of nodes in the network. The space complexity is O((Δ × d)2), where Δ is the largest degree of all the nodes in the communication network. The proposed algorithm can easily be adapted to devise a linear time optimal algorithm.