메뉴 건너뛰기




Volumn 93, Issue 7, 2008, Pages 1018-1024

An improved algorithm for searching all minimal cuts in modified networks

Author keywords

Minimal cut path (MC MP); Modified networks; Reliability

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; PROBLEM SOLVING; REINFORCEMENT LEARNING; VERIFICATION;

EID: 39749190758     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ress.2007.05.003     Document Type: Article
Times cited : (18)

References (27)
  • 1
    • 0023253456 scopus 로고
    • An efficient algorithm for simultaneously deducing MPs as well as cuts of a communication network
    • Samad M.A. An efficient algorithm for simultaneously deducing MPs as well as cuts of a communication network. Microelectron Reliab 27 (1987) 437-441
    • (1987) Microelectron Reliab , vol.27 , pp. 437-441
    • Samad, M.A.1
  • 2
    • 0024733248 scopus 로고
    • Estimation of reliability for communication/computer networks simulation/analytical approach
    • Kubat P. Estimation of reliability for communication/computer networks simulation/analytical approach. IEEE Trans Commun 37 (1989) 927-933
    • (1989) IEEE Trans Commun , vol.37 , pp. 927-933
    • Kubat, P.1
  • 3
    • 0026238929 scopus 로고
    • A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities
    • Rai S., and Soh S. A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities. IEEE Trans Reliab 40 (1991) 441-451
    • (1991) IEEE Trans Reliab , vol.40 , pp. 441-451
    • Rai, S.1    Soh, S.2
  • 4
    • 0031223605 scopus 로고    scopus 로고
    • Reliability evaluation for distributed computing networks with imperfect nodes
    • Ke W.J., and Wang S.D. Reliability evaluation for distributed computing networks with imperfect nodes. IEEE Trans Reliab 46 (1997) 342-349
    • (1997) IEEE Trans Reliab , vol.46 , pp. 342-349
    • Ke, W.J.1    Wang, S.D.2
  • 5
    • 0002994689 scopus 로고
    • Transportation network with random arc capacities
    • Doulliez P., and Jalnoulle E. Transportation network with random arc capacities. RAIRO, Rech Oper Res 3 (1972) 45-60
    • (1972) RAIRO, Rech Oper Res , vol.3 , pp. 45-60
    • Doulliez, P.1    Jalnoulle, E.2
  • 6
    • 0023246018 scopus 로고
    • Availability evaluation of oil/gas production and transportation systems
    • Aven T. Availability evaluation of oil/gas production and transportation systems. Reliab Eng 18 (1987) 35-44
    • (1987) Reliab Eng , vol.18 , pp. 35-44
    • Aven, T.1
  • 7
    • 0023859813 scopus 로고
    • Some considerations on reliability theory and its applications
    • Aven T. Some considerations on reliability theory and its applications. Reliab Eng Syst Saf 21 (1988) 215-223
    • (1988) Reliab Eng Syst Saf , vol.21 , pp. 215-223
    • Aven, T.1
  • 10
    • 0032683528 scopus 로고    scopus 로고
    • A heuristic technique for generating minimal path and cutsets of a general network
    • Al-Ghanim A.M. A heuristic technique for generating minimal path and cutsets of a general network. Comput Ind Eng 36 (1999) 45-55
    • (1999) Comput Ind Eng , vol.36 , pp. 45-55
    • Al-Ghanim, A.M.1
  • 11
    • 0036498784 scopus 로고    scopus 로고
    • Search for minimal paths in modified networks
    • Yeh W.C. Search for minimal paths in modified networks. Reliab Eng Syst Saf 75 3 (2002/3) 389-395
    • (2002) Reliab Eng Syst Saf , vol.75 , Issue.3 , pp. 389-395
    • Yeh, W.C.1
  • 12
    • 0028392803 scopus 로고
    • Enumeration of MPs of modified networks
    • Nahman J.M. Enumeration of MPs of modified networks. Microelectron Reliab 34 (1994) 475-484
    • (1994) Microelectron Reliab , vol.34 , pp. 475-484
    • Nahman, J.M.1
  • 13
    • 0031103023 scopus 로고    scopus 로고
    • Enumeration of minimal cuts of modified networks
    • Nahman J.M. Enumeration of minimal cuts of modified networks. Microelectron Reliab 37 (1997) 483-485
    • (1997) Microelectron Reliab , vol.37 , pp. 483-485
    • Nahman, J.M.1
  • 14
    • 0034139861 scopus 로고    scopus 로고
    • Search for MC in modified networks
    • Yeh W.C. Search for MC in modified networks. Comput Oper Res 28 (2001) 177-184
    • (2001) Comput Oper Res , vol.28 , pp. 177-184
    • Yeh, W.C.1
  • 15
    • 33746855565 scopus 로고    scopus 로고
    • A simple algorithm to search for all MCs in networks
    • Yeh W.C. A simple algorithm to search for all MCs in networks. Eur J Oper Res 174 3 (2006/11) 1694-1705
    • (2006) Eur J Oper Res , vol.174 , Issue.3 , pp. 1694-1705
    • Yeh, W.C.1
  • 16
    • 39749156385 scopus 로고    scopus 로고
    • Yeh WC. A simple heuristic algorithm for generating all minimal paths. IEEE Trans. Reliab., in press.
    • Yeh WC. A simple heuristic algorithm for generating all minimal paths. IEEE Trans. Reliab., in press.
  • 17
    • 0242691800 scopus 로고    scopus 로고
    • A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes
    • Yeh W.C. A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes. Reliab Eng Syst Saf 83 1 (2004/1) 47-55
    • (2004) Reliab Eng Syst Saf , vol.83 , Issue.1 , pp. 47-55
    • Yeh, W.C.1
  • 18
    • 0038337001 scopus 로고    scopus 로고
    • Multistate-node acyclic networks reliability evaluation based on MC
    • Yeh W.C. Multistate-node acyclic networks reliability evaluation based on MC. Reliab Eng Syst Saf 81 2 (2003/8) 225-231
    • (2003) Reliab Eng Syst Saf , vol.81 , Issue.2 , pp. 225-231
    • Yeh, W.C.1
  • 19
    • 0036133142 scopus 로고    scopus 로고
    • Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs
    • Lin Y. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab Eng Syst Saf 75 (2002) 41-46
    • (2002) Reliab Eng Syst Saf , vol.75 , pp. 41-46
    • Lin, Y.1
  • 20
    • 0043031393 scopus 로고    scopus 로고
    • Minimal cut sets of s-t networks with k-out-of-n nodes
    • Tan Z. Minimal cut sets of s-t networks with k-out-of-n nodes. Reliab Eng Syst Saf 82 1 (2003/10) 49-54
    • (2003) Reliab Eng Syst Saf , vol.82 , Issue.1 , pp. 49-54
    • Tan, Z.1
  • 21
    • 0027658565 scopus 로고
    • Reliability evaluation of a limited-flow network in terms of MC sets
    • Jane C.C., Lin J.S., and Yuan J. Reliability evaluation of a limited-flow network in terms of MC sets. IEEE Trans Reliab R-42 (1993) 354-361
    • (1993) IEEE Trans Reliab , vol.R-42 , pp. 354-361
    • Jane, C.C.1    Lin, J.S.2    Yuan, J.3
  • 22
    • 0032273391 scopus 로고    scopus 로고
    • A revised layered-network algorithm to search for all d-Minpaths of a limited-flow acyclic network
    • Yeh W.C. A revised layered-network algorithm to search for all d-Minpaths of a limited-flow acyclic network. IEEE Trans Reliab 46 (1998) 436-442
    • (1998) IEEE Trans Reliab , vol.46 , pp. 436-442
    • Yeh, W.C.1
  • 23
    • 0035147987 scopus 로고    scopus 로고
    • A simple approach to search for all d-MCs of a limited-flow network
    • Yeh W.C. A simple approach to search for all d-MCs of a limited-flow network. Reliab Eng Syst Saf 71 (2001) 15-19
    • (2001) Reliab Eng Syst Saf , vol.71 , pp. 15-19
    • Yeh, W.C.1
  • 24
    • 0035399562 scopus 로고    scopus 로고
    • A simple algorithm to search for all d-MPs with unreliable nodes.
    • Yeh W.C. A simple algorithm to search for all d-MPs with unreliable nodes. Reliab Eng Syst Saf 73 7 (2001) 49-54
    • (2001) Reliab Eng Syst Saf , vol.73 , Issue.7 , pp. 49-54
    • Yeh, W.C.1
  • 25
    • 0042530475 scopus 로고    scopus 로고
    • Network reliability estimates using linear and quadratic unreliability of minimal cuts
    • Jin T., and Coit D. Network reliability estimates using linear and quadratic unreliability of minimal cuts. Reliab Eng Syst Saf 82 1 (2003) 41-48
    • (2003) Reliab Eng Syst Saf , vol.82 , Issue.1 , pp. 41-48
    • Jin, T.1    Coit, D.2
  • 26
    • 4544265515 scopus 로고    scopus 로고
    • Dominant multi-state systems
    • Huang J., and Zuo M.J. Dominant multi-state systems. IEEE Trans Reliab 53 (2004) 362-368
    • (2004) IEEE Trans Reliab , vol.53 , pp. 362-368
    • Huang, J.1    Zuo, M.J.2
  • 27
    • 84941446735 scopus 로고
    • Computational complexity of network reliability analysis: an overview
    • Ball M.O. Computational complexity of network reliability analysis: an overview. IEEE Trans Reliab 35 (1986) 230-239
    • (1986) IEEE Trans Reliab , vol.35 , pp. 230-239
    • Ball, M.O.1


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