Computing Network Reliability in Time Polynomial in the Number of Cuts (Q3335484): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:48, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Network Reliability in Time Polynomial in the Number of Cuts |
scientific article |
Statements
Computing Network Reliability in Time Polynomial in the Number of Cuts (English)
0 references
1984
0 references
computing network reliability
0 references
polynomial algorithm
0 references
operating path
0 references
stochastic network
0 references
