메뉴 건너뛰기




Volumn 57, Issue 4, 2008, Pages 581-588

A fast algorithm for searching all multi-state minimal cuts

Author keywords

d MC MC; Limited flow (multi state) network; Network reliability; Perfect node; Unreliable node

Indexed keywords

CONTROL SYSTEMS; CONTROL THEORY; METROPOLITAN AREA NETWORKS; RELIABILITY;

EID: 57749117022     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2008.2006293     Document Type: Article
Times cited : (58)

References (23)
  • 4
    • 0030197678 scopus 로고    scopus 로고
    • A new approach to the minimum cut problem
    • D. R. Karger and C. Stein, "A new approach to the minimum cut problem," Journal of the ACM, vol. 43, no. 4, pp. 601-640, 1996.
    • (1996) Journal of the ACM , vol.43 , Issue.4 , pp. 601-640
    • Karger, D.R.1    Stein, C.2
  • 5
    • 0030247140 scopus 로고    scopus 로고
    • A cut-based method for terminal-pair reliability
    • Y. G. Chen and M. C. Yuang, "A cut-based method for terminal-pair reliability," IEEE Trans. Reliability, vol. 45, no. 3, pp. 413-416, 1996.
    • (1996) IEEE Trans. Reliability , vol.45 , Issue.3 , pp. 413-416
    • Chen, Y.G.1    Yuang, M.C.2
  • 6
    • 0031077339 scopus 로고    scopus 로고
    • A parallel algorithm evaluating the reliability of a system with known minimal cuts (paths)
    • J. Malinowski and W. Preuss, "A parallel algorithm evaluating the reliability of a system with known minimal cuts (paths)," Microelectronics & Reliability, vol. 37, no. 2, pp. 255-265, 1997.
    • (1997) Microelectronics & Reliability , vol.37 , Issue.2 , pp. 255-265
    • Malinowski, J.1    Preuss, W.2
  • 7
    • 0031103023 scopus 로고    scopus 로고
    • Enumeration of minimal cuts of modified networks
    • J. M. Nahman, "Enumeration of minimal cuts of modified networks," Microelectron. Reliability, vol. 37, pp. 483-485, 1997.
    • (1997) Microelectron. Reliability , vol.37 , pp. 483-485
    • Nahman, J.M.1
  • 8
    • 0034139861 scopus 로고    scopus 로고
    • Search for MC in modified networks
    • W. C. Yeh, "Search for MC in modified networks," Computers & Operations Research, vol. 28, no. 2, pp. 177-184, 2001.
    • (2001) Computers & Operations Research , vol.28 , Issue.2 , pp. 177-184
    • Yeh, W.C.1
  • 9
    • 0043031393 scopus 로고    scopus 로고
    • Minimal Cut Sets of s - t Networks with k out-of-n Nodes
    • Oct
    • Z. Tan, "Minimal Cut Sets of s - t Networks with k out-of-n Nodes," Reliability Engineering & System Safety vol. 82, no. 1, pp. 49-54, Oct. 2003.
    • (2003) Reliability Engineering & System Safety , vol.82 , Issue.1 , pp. 49-54
    • Tan, Z.1
  • 10
    • 33746855565 scopus 로고    scopus 로고
    • A Simple Algorithm to Search for All MCs in Networks
    • Nov
    • W. C. Yeh, "A Simple Algorithm to Search for All MCs in Networks," European Journal of Operational Research, vol. 174, no. 3, pp. 1694-1705, Nov. 2006.
    • (2006) European Journal of Operational Research , vol.174 , Issue.3 , pp. 1694-1705
    • Yeh, W.C.1
  • 11
    • 0023253456 scopus 로고
    • An efficient algorithm for simultaneously deducing MPs as well as cuts of a communication network
    • M. A. Samad, "An efficient algorithm for simultaneously deducing MPs as well as cuts of a communication network," Microelectron. Reliability vol. 27, pp. 437-441, 1987.
    • (1987) Microelectron. Reliability , vol.27 , pp. 437-441
    • Samad, M.A.1
  • 12
    • 0027148095 scopus 로고
    • Determination of minimal upper paths for reliability analysis of planar
    • D. W. Lee and B. J. Yum, "Determination of minimal upper paths for reliability analysis of planar," Reliability Engineering & System Safety, vol. 39, no. 1, pp. 1-19, 1993.
    • (1993) Reliability Engineering & System Safety , vol.39 , Issue.1 , pp. 1-19
    • Lee, D.W.1    Yum, B.J.2
  • 13
    • 0028392803 scopus 로고
    • Enumeration of MPs of modified networks
    • J. M. Nahman, "Enumeration of MPs of modified networks," Microelectron. Reliability, vol. 34, pp. 475-484, 1994.
    • (1994) Microelectron. Reliability , vol.34 , pp. 475-484
    • Nahman, J.M.1
  • 14
    • 0036498784 scopus 로고    scopus 로고
    • Search for Minimal Paths in Modified Networks
    • Mar
    • W. C. Yeh, "Search for Minimal Paths in Modified Networks," Reliability Engineering & System Safety, vol. 75, no. 3, pp. 389-395, Mar. 2002.
    • (2002) Reliability Engineering & System Safety , vol.75 , Issue.3 , pp. 389-395
    • Yeh, W.C.1
  • 15
    • 2142645090 scopus 로고    scopus 로고
    • Non-binary decomposition trees - A method of reliability computation for systems with known minimal paths/cuts
    • J. Malinowski, "Non-binary decomposition trees - A method of reliability computation for systems with known minimal paths/cuts," Reliability Engineering and System Safety, vol. 84, pp. 113-124, 2004.
    • (2004) Reliability Engineering and System Safety , vol.84 , pp. 113-124
    • Malinowski, J.1
  • 16
    • 0027658565 scopus 로고
    • Reliability evaluation of a limited-flow network in terms of minimal cutsets
    • Sep
    • C.-C. Jane, J.-S. Lin, and J. Yuan, "Reliability evaluation of a limited-flow network in terms of minimal cutsets," IEEE Trans. Reliability, vol. 42, no. 3, pp. 354-361, Sep. 1993, 368.
    • (1993) IEEE Trans. Reliability , vol.42 , Issue.3
    • Jane, C.-C.1    Lin, J.-S.2    Yuan, J.3
  • 17
    • 0035147987 scopus 로고    scopus 로고
    • A simple approach to search for all d-MCs of a limited-flow network
    • W. C. Yeh, "A simple approach to search for all d-MCs of a limited-flow network," Reliability Engineering and System Safety, vol. 71, no. 2, pp. 15-19, 2001.
    • (2001) Reliability Engineering and System Safety , vol.71 , Issue.2 , pp. 15-19
    • Yeh, W.C.1
  • 18
    • 0036833008 scopus 로고    scopus 로고
    • Search for All d-Mincuts of a Limited-Flow Network
    • Jun
    • W. C. Yeh, "Search for All d-Mincuts of a Limited-Flow Network," Computers & Operations Research, vol. 29, no. 13, pp. 1843-1858, Jun. 2002.
    • (2002) Computers & Operations Research , vol.29 , Issue.13 , pp. 1843-1858
    • Yeh, W.C.1
  • 19
    • 0036683430 scopus 로고    scopus 로고
    • A New Approach to the d-MC Problem
    • Aug
    • W. C. Yeh, "A New Approach to the d-MC Problem," Reliability Engineering & System Safety, vol. 77, no. 2, pp. 201-206, Aug. 2002.
    • (2002) Reliability Engineering & System Safety , vol.77 , Issue.2 , pp. 201-206
    • Yeh, W.C.1
  • 20
    • 0242691800 scopus 로고    scopus 로고
    • A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes
    • Jan
    • W. C. Yeh, "A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes," Reliability Engineering & System Safety, vol. 83, no. 1, pp. 47-55, Jan. 2004.
    • (2004) Reliability Engineering & System Safety , vol.83 , Issue.1 , pp. 47-55
    • Yeh, W.C.1
  • 21
    • 15544385599 scopus 로고    scopus 로고
    • An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities
    • S. Soh and S. Rai, "An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities," IEEE Trans. Reliability, vol. 54, no. 1, pp. 133-144, 2005.
    • (2005) IEEE Trans. Reliability , vol.54 , Issue.1 , pp. 133-144
    • Soh, S.1    Rai, S.2
  • 22
    • 31544472849 scopus 로고    scopus 로고
    • Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts
    • May
    • Y. K. Lin, "Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts," Reliability Engineering & System Safety, vol. 91, no. 5, pp. 539-545, May 2006.
    • (2006) Reliability Engineering & System Safety , vol.91 , Issue.5 , pp. 539-545
    • Lin, Y.K.1
  • 23
    • 33748328094 scopus 로고    scopus 로고
    • Improving efficiency of solving d-MC problem in stochastic-flow network
    • Jan
    • Z. Yan and M. Qian, "Improving efficiency of solving d-MC problem in stochastic-flow network," Reliability Engineering & System Safety vol. 92, no. 1, pp. 30-39, Jan. 2007.
    • (2007) Reliability Engineering & System Safety , vol.92 , Issue.1 , pp. 30-39
    • Yan, Z.1    Qian, M.2


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