The Complexity of the Residual Node Connectedness Reliability Problem (Q3204046)
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 the Residual Node Connectedness Reliability Problem |
scientific article; zbMATH DE number 4180803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of the Residual Node Connectedness Reliability Problem |
scientific article; zbMATH DE number 4180803 |
Statements
The Complexity of the Residual Node Connectedness Reliability Problem (English)
0 references
1991
0 references
planar graphs
0 references
{\#}P-completeness
0 references
network reliability
0 references
bipartite graphs
0 references
0.9194952
0 references
0.9184945
0 references
0.88064086
0 references
0 references
