Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
33
Voted
JACM
2010
favorite
Email
discuss
report
111
views
more
JACM 2010
»
Finding a maximum matching in a sparse random graph in O(n) expected time
13 years 9 months ago
Download
www.math.cmu.edu
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.
Prasad Chebolu, Alan M. Frieze, Páll Melste
Real-time Traffic
JACM 2010
|
Linear Expected Time
|
Maximum Cardinality Matchings
|
Sparse Random Graphs
|
claim paper
Related Content
»
Solving Sparse Random Instances of Max Cut and Max 2CSP in Linear Expected Time
»
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
more »
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)
Researcher Info
JACM 2008 Study Group
Computer Vision