Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections

Details Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections

2008-07-08

arxiv.org/abs/0807.1277v1

Computer Science

Discrete Mathematics

24 pages

Scientific paper

We derive new results for the performance of a simple greedy algorithm for finding large independent sets and matchings in constant degree regular graphs. We show that for $r$-regular graphs with $n$ nodes and girth at least $g$, the algorithm finds an independent set of expected cardinality $f(r)n - O\big(\frac{(r-1)^{\frac{g}{2}}}{\frac{g}{2}!} n\big)$, where $f(r)$ is a function which we explicitly compute. A similar result is established for matchings. Our results imply improved bounds for the size of the largest independent set in these graphs, and provide the first results of this type for matchings. As an implication we show that the greedy algorithm returns a nearly perfect matching when both the degree $r$ and girth $g$ are large. Furthermore, we show that the cardinality of independent sets and matchings produced by the greedy algorithm in \emph{arbitrary} bounded degree graphs is concentrated around the mean. Finally, we analyze the performance of the greedy algorithm for the case of random i.i.d. weighted independent sets and matchings, and obtain a remarkably simple expression for the limiting expected values produced by the algorithm. In fact, all the other results are obtained as straightforward corollaries from the results for the weighted case.

Affiliated with

Also associated with

No associations

Rating

Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269038