메뉴 건너뛰기




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;

EID: 0035439423     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144501387141     Document Type: Article
Times cited : (81)

References (27)
  • 12
    • 0033298274 scopus 로고    scopus 로고
    • A randomized fully polynomial approximation scheme for the all terminal network reliability problem
    • (1999) SIAM J. Comput. , vol.29 , pp. 492-514
    • Karger, D.R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.