A simple proof that finding a maximal independent set in a graph is in NC (Q834937)
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: A simple proof that finding a maximal independent set in a graph is in NC |
scientific article; zbMATH DE number 5599154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof that finding a maximal independent set in a graph is in NC |
scientific article; zbMATH DE number 5599154 |
Statements
A simple proof that finding a maximal independent set in a graph is in NC (English)
0 references
27 August 2009
0 references
parallel algorithms
0 references
graph algorithms
0 references
maximal independent set
0 references
0 references
0.89347357
0 references
0 references
0.87920845
0 references
0.8786108
0 references
0.87822276
0 references
0.8771677
0 references
0.87116486
0 references
0.8709523
0 references
0.8708216
0 references
0.8705146
0 references
