메뉴 건너뛰기




Volumn 37, Issue 5, 1997, Pages 809-814

Pathset enumeration of directed graphs by the set theoretic method

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; RELIABILITY; SYSTEMS ANALYSIS;

EID: 0031148105     PISSN: 00262714     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0026-2714(96)00145-X     Document Type: Article
Times cited : (5)

References (11)
  • 1
    • 0019213411 scopus 로고
    • Enumeration of all simple paths in communication network
    • Misra, R. B. and Misra, K. B., Enumeration of all simple paths in communication network. Microelectron. Reliab., 1980, 20, 419-426.
    • (1980) Microelectron. Reliab. , vol.20 , pp. 419-426
    • Misra, R.B.1    Misra, K.B.2
  • 2
    • 0041479407 scopus 로고
    • Enumeration of success paths in a graph
    • Hura, G. S., Enumeration of success paths in a graph. Microelectron. Reliab., 1982, 22(5), 1033-1034.
    • (1982) Microelectron. Reliab. , vol.22 , Issue.5 , pp. 1033-1034
    • Hura, G.S.1
  • 3
    • 0020599109 scopus 로고
    • Enumeration of all simple paths in a directed graph using Petrinet: A systematic approach
    • Hura, G. S., Enumeration of all simple paths in a directed graph using Petrinet: a systematic approach. Microelectron. Reliab., 1983, 23(1), 157-159.
    • (1983) Microelectron. Reliab. , vol.23 , Issue.1 , pp. 157-159
    • Hura, G.S.1
  • 4
    • 0023330012 scopus 로고
    • An algorithm for symbolic reliability computation with Pathset or Cutset
    • Fong, C. and Buzzacott, J. A., An algorithm for symbolic reliability computation with Pathset or Cutset. IEEE Trans. Rel., 1987, R-36(1), 34-37.
    • (1987) IEEE Trans. Rel. , vol.R-36 , Issue.1 , pp. 34-37
    • Fong, C.1    Buzzacott, J.A.2
  • 5
    • 0023275482 scopus 로고
    • An efficient method for terminal and multiterminal pathset enumeration
    • Samad, M. A., An efficient method for terminal and multiterminal pathset enumeration. Microelectron. Reliab., 1987, 27(3), 443-446.
    • (1987) Microelectron. Reliab. , vol.27 , Issue.3 , pp. 443-446
    • Samad, M.A.1
  • 8
    • 0026910557 scopus 로고
    • Reduction of computations in enumeration of terminal and multiterminal pathsets by the method of indexing
    • Aziz, M. A., Sobhan, M. A. and Samad, M. A., Reduction of computations in enumeration of terminal and multiterminal pathsets by the method of indexing. Microelectron. Reliab., 1992, 32(8), 1067-1072.
    • (1992) Microelectron. Reliab. , vol.32 , Issue.8 , pp. 1067-1072
    • Aziz, M.A.1    Sobhan, M.A.2    Samad, M.A.3
  • 9
    • 0027553554 scopus 로고
    • Enumeration of pathsets of reliability graphs by repeated indexing
    • Aziz, M. A., Sobhan, M. A. and Samad, M. A., Enumeration of pathsets of reliability graphs by repeated indexing. Microelectron. Reliab., 1993, 33(4), 481-487.
    • (1993) Microelectron. Reliab. , vol.33 , Issue.4 , pp. 481-487
    • Aziz, M.A.1    Sobhan, M.A.2    Samad, M.A.3
  • 10
    • 0028483818 scopus 로고
    • Fast enumeration of every path in a reliability graph using subgraphs
    • Aziz, M. A., Sobhan, M. A. and Samad, M. A., Fast enumeration of every path in a reliability graph using subgraphs. Microelectron. Reliab., 1994, 34(8), 1395-1396.
    • (1994) Microelectron. Reliab. , vol.34 , Issue.8 , pp. 1395-1396
    • Aziz, M.A.1    Sobhan, M.A.2    Samad, M.A.3
  • 11
    • 0029254706 scopus 로고
    • A set theoretic method for enumeration of pathsets of nondirected graphs
    • Aziz, M. A., A set theoretic method for enumeration of pathsets of nondirected graphs. Microelectron. Reliab., 1995, 35(2), 295-298.
    • (1995) Microelectron. Reliab. , vol.35 , Issue.2 , pp. 295-298
    • Aziz, M.A.1


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