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

13 years 3 months ago

Download www.math.cmu.edu

We present a linear expected time algorithm for ﬁnding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic factor.

Prasad Chebolu, Alan M. Frieze, Páll Melste

Real-time Traffic

JACM 2010 | Linear Expected Time | Maximum Cardinality Matchings | Sparse Random Graphs |

claim paper

» Finding a Maximum Independent Set in a Sparse Random Graph

» Finding Large Independent Sets in Polynomial Expected Time

» Matching Algorithms Are Fast in Sparse Random Graphs

» A Separator Theorem for Graphs with an Excluded Minor and its Applications

» Counting Subgraphs via Homomorphisms

» Tight Bounds for the Cover Time of Multiple Random Walks

» Using the SmallWorld Model to Improve Freenet Performance

» Graphical Models and Point Pattern Matching

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	JACM
Authors	Prasad Chebolu, Alan M. Frieze, Páll Melsted

Comments (0)

Sciweavers

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

JACM 2010 | Linear Expected Time | Maximum Cardinality Matchings | Sparse Random Graphs |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers