Asymptotic performance of the Grimmett-McDiarmid heuristic
Data Structures and Algorithms
2019-12-11 v1 Discrete Mathematics
Combinatorics
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 (with high probability) on a random graph. We determine the asymptotic distribution of the size of the stable set found by the algorithm.
Cite
@article{arxiv.1912.04772,
title = {Asymptotic performance of the Grimmett-McDiarmid heuristic},
author = {Yuval Filmus},
journal= {arXiv preprint arXiv:1912.04772},
year = {2019}
}
Comments
5 pages, 1 figure