Abstract
Recently two randomized algorithms were discovered that find a maximum matching in an arbitrary graph in polylog time, when run on a parallel random access machine. Both are Monte Carlo algorithms — they have the drawback that with non-zero probability the output is a non-maximum matching. We use the min-max formula for the size of a maximum matching to convert any Monte Carlo maximum matching algorithm into a Las Vegas (error-free) one. The resulting algorithm returns (with high probability) a maximum matching and a certificate proving that the matching is indeed maximum.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Edmonds, Paths, Trees, and Flowers,Canadian J. Math. 17 (1965), 449–467.
Z. Galil andV. Pan, Fast and Efficient Randomized Parallel Computation of a Perfect Matching in a Graph,to appear in Proc. of the Twenty-Sixth Annual Symp. on the Foundations of Computer Science, 1985.
R. M. Karp, E. Upfal andA. Wigderson, Constructing a perfect matching is in random NC,Combinatorica 6 (1986).
R. M. Karp andA. Wigderson, A Fast Parallel Algorithm for the Maximal Independent Set Problem,Proc. of the Sixteenth Ann. ACM Symp. on Theory of Computing (1984), 266–272.
L. Lovász,private communication.
L. Lovász,Combinatorial Problems and Exercises, North-Holland, New York, 1979.
L. Lovász, On the Structure of Factorizable Graphs,Acta Mathematica Academiae Scientiarum Hungaricae,23 (1972), 179–195.
M. Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem,Proc. of the Seventeenth Ann. ACM Symp. on Theory of Computing (1985), 1–10.
A. Schrijver, Min-max results in combinatorial optimization,in: Mathematical Programming the state of the Art (Bonn 1982), (ed: A. Bachem, M. Grötschel, B. Korte), Springer-Verlag, New York, 1983.
Author information
Authors and Affiliations
Additional information
Research supported by DARPA grant N00039-84-C-0098 and by a US Army Research Office fellowship.