An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size (Q3136616)
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: An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size |
scientific article; zbMATH DE number 425598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size |
scientific article; zbMATH DE number 425598 |
Statements
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size (English)
0 references
14 October 1993
0 references
Turán's theorem
0 references
NC
0 references
independent set
0 references
CRCW PRAM
0 references
0.92202514
0 references
0.9218348
0 references
0.9161016
0 references
0.91578424
0 references
0.9149286
0 references
0.9136189
0 references
0.91308784
0 references
0.9088092
0 references
0.90798366
0 references
