메뉴 건너뛰기




Volumn 26, Issue 10, 1979, Pages 855-865

A new analysis technique for probabilistic graphs

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

EID: 0018532893     PISSN: 00984094     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCS.1979.1084573     Document Type: Article
Times cited : (106)

References (10)
  • 2
    • 0015111787 scopus 로고
    • A computerized algorithm for determining the reliability of redundant configurations
    • Aug.
    • D. B. Brown, “A computerized algorithm for determining the reliability of redundant configurations, ” IEEE Trans. Rel., vol. R-20, Aug. 1971.
    • (1971) IEEE Trans. Rel. , vol.R-20
    • Brown, D.B.1
  • 4
    • 84939025514 scopus 로고
    • SYMRAP-A Symbolic Reliability Assessment Program
    • May
    • P. M. Lin et al., “SYMRAP-A Symbolic Reliability Assessment Program, ” DDC AD-A013-730, May 1975.
    • (1975) DDC AD-A013-730
    • Lin, P.M.1
  • 5
    • 0016944224 scopus 로고
    • A new algorithm for symbolic system reliability analysis
    • Apr.
    • P. M. Lin et. al., “A new algorithm for symbolic system reliability analysis, ” IEEE Trans. Rel., vol. R-25, Apr. 1976.
    • (1976) IEEE Trans. Rel. , vol.R-25
    • Lin, P.M.1
  • 6
    • 0015360568 scopus 로고
    • A fast recursive algorithm to calculate the reliability of a communication network
    • June
    • E. Hansler, “A fast recursive algorithm to calculate the reliability of a communication network, ” IEEE Trans. Commun., vol. COM-20, June 1972.
    • (1972) IEEE Trans. Commun. , vol.COM-20
    • Hansler, E.1
  • 7
    • 84939062228 scopus 로고
    • Comments on a fast recursive algorithm to calculate the reliability of a communication network
    • May
    • —, “Comments on a fast recursive algorithm to calculate the reliability of a communication network, ” IEEE Trans. Commun., vol. COM-23, May 1975.
    • (1975) IEEE Trans. Commun. , vol.COM-23
  • 8
    • 0015626643 scopus 로고
    • A Boolean algebra method for computing the terminal reliability in a communication network
    • May
    • L. Fratta and U. G. Montanari, “A Boolean algebra method for computing the terminal reliability in a communication network, ” IEEE Trans. Circuit Theory, vol. CT-20, May 1973.
    • (1973) IEEE Trans. Circuit Theory , vol.CT-20
    • Fratta, L.1    Montanari, U.G.2
  • 9
    • 84939044029 scopus 로고
    • Some new algorithms for deterministic and probabilistic communication networks
    • June
    • P. M. Lin et al., “Some new algorithms for deterministic and probabilistic communication networks, ” DDC AD-785-119, June 1974.
    • (1974) DDC AD-785-119
    • Lin, P.M.1
  • 10
    • 0014781752 scopus 로고
    • A computer program for approximating system reliability
    • May
    • A. C. Nelson, Jr. et al., “A computer program for approximating system reliability, ” IEEE Trans. Rel., vol. R-19, May 1970.
    • (1970) IEEE Trans. Rel. , vol.R-19
    • Nelson, A.C.1


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