Finding a Maximum Independent Set in a Sparse Random Graph

Uriel Feige, Eran Ofek. Finding a Maximum Independent Set in a Sparse Random Graph. Electronic Colloquium on Computational Complexity (ECCC), (050), 2005. [doi]

Abstract

Abstract is missing.