A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability (Q3716781): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1002/net.3230150204 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017419657 / rank | |||
Normal rank | |||
Latest revision as of 02:02, 20 March 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
