Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

SODA
1993
ACM

favoriteEmaildiscussreport

94views Algorithms» more SODA 1993»

Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs

13 years 5 months ago

Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs

Download www.math.cmu.edu

We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched by MINGREEDY, then there are positive constants c1 and c2 such that c1n1/5 ≤ λn ≤ c2n1/5 log n.

Alan M. Frieze, A. J. Radcliffe, Stephen Suen

Real-time Traffic

Algorithms | Cubic Graphs | Expected Number | Simple Greedy Matching | SODA 1993 |

claim paper

Related Content

» Minimum Connected Dominating Sets of Random Cubic Graphs

» Analysis of Random Processes via AndOr Tree Evaluation

» Large independent sets in regular graphs of large girth

» A Comparative Analysis of Specific Spatial Network Topological Models

» On the complexity of scheduling in wireless networks

» Online algorithms for market clearing

» Semisupervised learning of object categories from paired local features

» Analyzing Kleinbergs and other smallworld Models

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1993
Where	SODA
Authors	Alan M. Frieze, A. J. Radcliffe, Stephen Suen

Comments (0)