메뉴 건너뛰기




Volumn 19, Issue 1, 1989, Pages 135-149

Domination theory and the crapo β‐invariant

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84986977038     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230190111     Document Type: Article
Times cited : (24)

References (12)
  • 1
    • 84987006065 scopus 로고
    • A graph theoretic appraisal of the complexity of network reliability algorithms. Dept. of IEOR, University of California, Berkeley
    • (1981)
    • Chang, M.K.1
  • 3
    • 84987033489 scopus 로고
    • A unified theory of domination and signed domination with application to exact reliability computations. Statistical Research Report 3, University of Oslo
    • (1984)
    • Huseby, A.B.1
  • 4
    • 84986997632 scopus 로고
    • Some combinatorial aspects of network reliability. Ph.D. Thesis, Dept. of IEOR, University of California, Berkeley
    • (1982)
    • Johnson, R.1
  • 11
    • 0022075717 scopus 로고
    • A factoring algorithm using polygon‐to‐chain reductions for computing k‐terminal network reliability
    • (1985) Networks , vol.35 , pp. 173-190
    • Wood, R.K.1


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