Asymptotic performance of the Grimmett-McDiarmid heuristic
Abstract
Grimmett and McDiarmid suggested a simple heuristic for finding stable sets in random graphs. They showed that the heuristic finds a stable set of size 2 n (with high probability) on a G(n, 1/2) random graph. We determine the asymptotic distribution of the size of the stable set found by the algorithm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.