Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs (Q5202014)
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: Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs |
scientific article; zbMATH DE number 4193434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs |
scientific article; zbMATH DE number 4193434 |
Statements
Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs (English)
0 references
1990
0 references
efficient network reliability approximation algorithm
0 references
0.847754180431366
0 references
0.8314487934112549
0 references
0.8124620914459229
0 references
0.811185896396637
0 references
0.8107138872146606
0 references
