|
Volumn 43, Issue 3, 2001, Pages 499-522
|
A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
|
Author keywords
Approximation scheme; Minimum cut; Network reliability
|
Indexed keywords
ERROR ANALYSIS;
POLYNOMIAL APPROXIMATION;
PROBABILITY;
RELIABILITY;
NETWORK RELIABILITY;
GRAPH THEORY;
|
EID: 0035439423
PISSN: 00361445
EISSN: None
Source Type: Journal
DOI: 10.1137/S0036144501387141 Document Type: Article |
Times cited : (81)
|
References (27)
|