Computing Network Reliability in Time Polynomial in the Number of Cuts (Q3335484): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.32.3.516 / rank | |||
| 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.1287/opre.32.3.516 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169621137 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.32.3.516 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:17, 21 December 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
