A self-stabilizing 23-approximation algorithm for the maximum matching problem
- 16 September 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (40) , 5515-5526
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A new self-stabilizing maximal matching algorithmTheoretical Computer Science, 2009
- Distance- k knowledge in self-stabilizing algorithmsTheoretical Computer Science, 2008
- Maximal matching stabilizes in time O(m)Information Processing Letters, 2001
- Maximal matching stabilizes in quadratic timeInformation Processing Letters, 1994
- A self-stabilizing algorithm for maximal matchingInformation Processing Letters, 1992
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973