The complexity of computing the 2-K-reliability in networks (Q2448852)
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 complexity of computing the 2-K-reliability in networks |
scientific article; zbMATH DE number 6291948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing the 2-K-reliability in networks |
scientific article; zbMATH DE number 6291948 |
Statements
The complexity of computing the 2-K-reliability in networks (English)
0 references
5 May 2014
0 references
network reliability
0 references
survivability
0 references
fault tolerance
0 references
diameter constraints
0 references
combinatorial problems
0 references
computational complexity
0 references
0.9021251797676086
0 references
0.8253664970397949
0 references
0.8182942271232605
0 references
0.8136394619941711
0 references
0.7895795702934265
0 references
