Triconnected decomposition for computingK-terminal network reliability (Q3827780)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4102795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triconnected decomposition for computingK-terminal network reliability |
scientific article; zbMATH DE number 4102795 |
Statements
Triconnected decomposition for computingK-terminal network reliability (English)
0 references
1989
0 references
undirected graph
0 references
failure probabilities of the edges
0 references
reliability
0 references
triconnected decomposition
0 references
recursive factoring algorithm
0 references
K-terminal reliability
0 references
0.8676530718803406
0 references
0.857048749923706
0 references
0.8554527759552002
0 references
0.8527602553367615
0 references
