A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability (Q3716781): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:37, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability |
scientific article |
Statements
A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability (English)
0 references
1985
0 references
undirected graph
0 references
Edge failures
0 references
K-terminal reliability
0 references
factoring algorithm
0 references
computing network reliability
0 references
