Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Uriel Feige, Eran Ofek. Finding a Maximum Independent Set in a Sparse Random Graph. Electronic Colloquium on Computational Complexity (ECCC), (050), 2005. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Finding a Maximum Independent Set in a Sparse Random GraphUriel Feige, Eran Ofek. approx 2005: 282-293 [doi] Finding a Maximum Independent Set in a Sparse Random GraphUriel Feige, Eran Ofek. siamdm, 22(2):693-718, 2008. [doi]
The following publications are possibly variants of this publication: