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 the normal view instead:
scientific article; zbMATH DE number 5558434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a Maximum Independent Set in a Sparse Random Graph |
scientific article; zbMATH DE number 5558434 |
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
0.9945454001426696
0 references
0.8836709260940552
0 references
0.8709535598754883
0 references
0.8708042502403259
0 references
