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

Authors:
Prasad Chebolu;Alan Frieze;P'all Melsted
Affiliations:
Carnegie Mellon University, Pittsburgh, Pennsylvania;Carnegie Mellon University, Pittsburgh, Pennsylvania;Carnegie Mellon University, Pittsburgh, Pennsylvania
Venue:
Journal of the ACM (JACM)
Year:
2010

Citing 4
Cited 3

Average-case analysis of algorithms for matchings and related problems

Journal of the ACM (JACM)
Maximum matchings in sparse random graphs: Karp-Sipser revisited

Random Structures & Algorithms
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Maximum matching in sparse random graphs

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science

Design, implementation, and analysis of maximum transversal algorithms

ACM Transactions on Mathematical Software (TOMS)
Stochastic matching with commitment

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A more reliable greedy heuristic for maximum matchings in sparse random graphs

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.