Finding a Maximum Independent Set in a Sparse Random Graph (Q3629470)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a Maximum Independent Set in a Sparse Random Graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a Maximum Independent Set in a Sparse Random Graph |
scientific article |
Statements
Finding a Maximum Independent Set in a Sparse Random Graph (English)
0 references
27 May 2009
0 references
average case
0 references
maximum independent set
0 references
