Abstract
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic factor.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aronson, J., Frieze, A.M., Pittel, B.: Maximum matchings in sparse random graphs: Karp-Sipser revisited. Random Structures and Algorithms 12, 111–177 (1998)
Bast, H., Mehlhorn, K., Schäfer, G., Tamaki, H.: Matching Algorithms are Fast in Sparse Random Graphs. Theory of Computing Systems 39, 3–14 (2006)
Edmonds, J.: Paths, Trees and Flowers. Canadian Journal of Mathematics 17, 449–467 (1965)
Frieze, A.M., Pittel, B.: Perfect matchings in random graphs with prescribed minimal degree. In: Trends in Mathematics, pp. 95–132. Birkhauser Verlag, Basel (2004)
Karp, R.M., Sipser, M.: Maximum Matchings in Sparse Random Graphs. In: Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, pp. 364–375 (1981)
Micali, S., Vazirani, V.V.: An \(O(\sqrt{V}E)\) Algorithm for Finding Maximum Matching in General Graphs. In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 17–27 (1980)
Motwani, R.: Average-case Analysis of Algorithms for Matchings and Related Problems. Journal of the ACM 41, 1329–1356 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chebolu, P., Frieze, A., Melsted, P. (2008). Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-70575-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70574-1
Online ISBN: 978-3-540-70575-8
eBook Packages: Computer ScienceComputer Science (R0)