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]

Authors

Uriel Feige

This author has not been identified. Look up 'Uriel Feige' in Google

Eran Ofek

This author has not been identified. Look up 'Eran Ofek' in Google