Finding a maximum matching in a sparse random graph in O(n) expected time

Journal of the ACM

Volumn 57, Issue 4, 2010, Pages

  Chebolu, Prasad ^a   Frieze, Alan ^a   Melsted, Páll ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Matching; Random graphs

Indexed keywords

CARDINALITIES; EXPECTED TIME; MATCHINGS; MAXIMUM MATCHINGS; RANDOM GRAPHS;

GRAPH THEORY;

EID: 77952039576     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1734213.1734218     Document Type: Article

References (9)

1. ARONSON, J., FRIEZE, A., AND PITTEL, B. 1998. Maximum matchings in sparse random graphs: Karp- Sipser revisited. Rand. Struct. Algor. 12, 111-177.
2. BAST, H.,MEHLHORN, K., SCHÄFER, G., AND TAMAKI, H. 2006. Matching algorithms are fast in sparse random graphs. Theory Comput. Syst. 39, 3-14.
3. BOLLOB́AS, B. 1980. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combinat. 1, 311-316.
4. EDMONDS, J. 1965. Paths, trees and flowers. Canad. J. Math. 17, 449-467.
5. FRIEZE, A. M., AND PITTEL, B. 2004. Perfect matchings in random graphs with prescribed minimal degree. Trends Math. 17, 95-132.
6. KARP, R. M., AND SIPSER, M. 1981. Maximum matchings in sparse random graphs. In Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 364-375.
7. MCKAY, B. D. 1985. Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combinatoria 19, 15-25.
8. MICALI, S., AND VAZIRANI, V. 1980. An O(̃V E) algorithm for finding maximum matching in general graphs. In Proceedings of the 21st IEEE Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 17-27.
9. MOTWANI,R. 1994. Average-case analysis of algorithms for matchings and related problems. J. ACM 41, 1329-1356.