The Complexity of the Residual Node Connectedness Reliability Problem (Q3204046): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0220009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093187872 / rank | |||
Normal rank | |||
Latest revision as of 20:40, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of the Residual Node Connectedness Reliability Problem |
scientific article |
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
