The computational complexity of the parallel knock-out problem (Q2481963)
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: The computational complexity of the parallel knock-out problem |
scientific article; zbMATH DE number 5264273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of the parallel knock-out problem |
scientific article; zbMATH DE number 5264273 |
Statements
The computational complexity of the parallel knock-out problem (English)
0 references
15 April 2008
0 references
parallel knock-out
0 references
graphs
0 references
computational complexity
0 references
0.9616337418556212
0 references
0.8762808442115784
0 references
0.8745747804641724
0 references
0.8603482842445374
0 references
0.8603115677833557
0 references
