A derandomized approximation algorithm for the critical node detection problem (Q336925)
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 derandomized approximation algorithm for the critical node detection problem |
scientific article; zbMATH DE number 6650629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A derandomized approximation algorithm for the critical node detection problem |
scientific article; zbMATH DE number 6650629 |
Statements
A derandomized approximation algorithm for the critical node detection problem (English)
0 references
10 November 2016
0 references
critical node detection problem
0 references
randomized rounding
0 references
complex network
0 references
0.9281666
0 references
0 references
0.8999042
0 references
0.8934331
0 references
0.8906557
0 references
0.8901699
0 references
0.8810439
0 references
