Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time

Prasad Chebolu,Páll Melsted,Alan Frieze

doi:10.1007/978-3-540-70575-8_14

Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time

Prasad Chebolu, Páll Melsted + Show 1 more

Open Access

https://doi.org/10.1007/978-3-540-70575-8_14

Copy DOI

Publication Date: Jan 1, 2008
Citations: 1	License type: cc-by

Affiliation: Carnegie Mellon University

#Finding Maximum Matchings #Sparse Random Graph + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.KeywordsRandom GraphMaximum MatchGiant ComponentPendant VertexCurrent GraphThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Full Text