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.
AMS subject classification (1986)05 C 99 68 E 10
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- R. M. Karp, E. Upfal andA. Wigderson, Constructing a perfect matching is in random NC,Combinatorica 6 (1986).Google Scholar
- 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.Google Scholar
- L. Lovász,private communication.Google Scholar
- 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.Google Scholar
- 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.Google Scholar