Computing Network Reliability in Time Polynomial in the Number of Cuts (Q3335484)
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: Computing Network Reliability in Time Polynomial in the Number of Cuts |
scientific article; zbMATH DE number 3867024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Network Reliability in Time Polynomial in the Number of Cuts |
scientific article; zbMATH DE number 3867024 |
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
0.8321956992149353
0 references
0.8271555304527283
0 references
0.8261680603027344
0 references
