172 search results - page 1 / 35 » The Analysis of a List-Coloring Algorithm on a Random Graph |
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
SODA
1993
ACM
13 years 6 months ago
1993
ACM
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...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
COMPGEOM
2009
ACM
13 years 12 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...