Optimal serverless networks attacks, complexity and some approximate algorithms (Q4929332)
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: Optimal serverless networks attacks, complexity and some approximate algorithms |
scientific article; zbMATH DE number 5790213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal serverless networks attacks, complexity and some approximate algorithms |
scientific article; zbMATH DE number 5790213 |
Statements
22 September 2010
0 references
NP-complete
0 references
attack strategies
0 references
network connectivity
0 references
optimal attack problem
0 references
0.7520655393600464
0 references
0.7402849793434143
0 references
0.7377007603645325
0 references
0.7364919185638428
0 references
0.7333484888076782
0 references
