Abstract
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability every non-maximum matching has an augmenting path of length O(log n). This implies that augmenting path algorithms like the Hopcroft–Karp algorithm for bipartite graphs and the Micali–Vazirani algorithm for general graphs, which have a worst case running time of \(O(m\sqrt{n})\), run in time O(m log n) with high probability, where m is the number of edges in the graph. Motwani proved these results for random graphs when the average degree is at least ln(n) [Average Case Analysis of Algorithms for Matchings and Related Problems, Journal of the ACM, 41(6), 1994]. Our results hold, if only the average degree is a large enough constant. At the same time we simplify the analysis of Motwani.
Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aigner, M., Ziegler, G.M.: Proofs from THE BOOK. Springer, Heidelberg (2001)
Cherkassky, B.V., Goldberg, A.V., Martin, P., Setubal, J.C., Stolfi, J.: Augment or push: A computational study of bipartite matching and unit-capacity flow algorithms. The ACM Journal of Experimental Algorithmics 3 (1998), http://www.jea.acm.org/1998/CherkasskyAugment
Cheriyan, J., Mehlhorn, K.: Algorithms for dense graphs and networks on the random access computer. Algorithmica 15(6), 521–549 (1996)
Edmonds, J.: Maximum matching and a polyhedron with (0, 1) vertices. Journal of Research of the National Bureau of Standards 69(b), 125–130 (1965)
Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449–467 (1965)
Erdös, P., Rènyi, A.: On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)
Feder, T., Motwani, R.: Clique partitions, graph compression and speeding up algorithms. Journal of Computer and System Sciences (JCSS) 51(2), 261–272 (1995)
Gabow, H.N.: An efficient implementation of Edmond’s algorithm for maximum matching on graphs. Journal of the ACM 23, 221–234 (1976)
Gnuplot, http://www.gnuplot.info
Hopcroft, J.E., Karp, R.M.: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing 2(4), 225–231 (1973)
Mehlhorn, K., Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Motwani, R.: Average-case analysis of algorithms for matchings and related problems. Journal of the ACM 41(6), 1329–1356 (1994)
Micali, S., Vazirani, V.: An O(|V|0.5|E|) algorithm for finding maximum matchings in general graphs. In: Foundations of Computer Science, pp. 17–27 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bast, H., Mehlhorn, K., Schäfer, G., Tamaki, H. (2004). Matching Algorithms Are Fast in Sparse Random Graphs. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive