A new efficient algorithm for generating all minimal tie-sets connecting selected nodes in a mesh-structured network

IEEE Transactions on Reliability

Volumn 59, Issue 1, 2010, Pages 203-211

  Malinowski, Jacek ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Backtracking; Breadth first search; Loop free path; Mesh structured network; Minimal tie set; Spanning tree

Indexed keywords

BACKTRACKING ALGORITHM; BREADTH-FIRST SEARCH; CLASSIC ALGORITHM; EDGE REPLACEMENT; EFFICIENT ALGORITHM; EFFICIENT METHOD; FOLLOWING PROBLEM; LOOP-FREE PATHS; MAIN TASKS; MESH-STRUCTURED; RECURSIVE PROCEDURE; SPANNING TREE; TIE-SETS; UNDIRECTED GRAPH;

ALGORITHMS; PEOPLE MOVERS;

GRAPH THEORY;

EID: 77749310437     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2009.2036712     Document Type: Article

References (15)

1. M. Fotuhi-Firuzabad, R. Billinton, T. S. Munian, and B. Vinayagam, "A novel approach to determine minimal tie-sets of complex network," IEEE Trans. Reliability, vol. 53, no. 1, pp. 61-70, 2004.
2. H. N. Gabow and E. W. Myers, "Finding all spanning trees of directed and undirected graphs," SIAM Journal on Computing, vol. 7, pp. 280-287, 1978.
3. S. Kapoor and H. Ramesh, "Algorithms for enumerating all spanning trees of undirected and weighted graphs," SIAM Journal on Computing, vol. 24, no. 2, pp. 247-265, 1995.
4. S. Kapoor and H. Ramesh, "An algorithm for enumerating all spanning trees of a directed graph," Algorithmica, vol. 27, no. 2, pp. 120-130, 2000.
5. D. B. West, Introduction to GraphTheory, Second Edition ed.: Prentice Hall, 2001.
6. P. Lauchli, Algoritmische Graphentheorie.: Birkhauser Verlag, 1991.
7. 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, no. 2, pp. 113-124, 2004.
8. H. Schabe, "An improved algorithm for cutset evaluation from paths," Microelectronics and Reliability, vol. 35, no. 5, pp. 783-787, 1995.
9. A. Shioura, A. Tamura, and T. Uno, "An optimal algorithm for scanning all spanning trees of undirected graphs," SIAM Journal on Computing, vol. 26, no. 3, pp. 678-692, 1997.
10. L. Traldi, "Non-minimal sums of disjoint products," Reliability Engineering and System Safety, vol. 91, no. 5, pp. 533-538, 2006.
11. W.-C. Yeh, "An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths," Reliability Engineering and System Safety, vol. 92, no. 2, pp. 260-268, 2007.
12. S.-Y. Kuo, F.-M. Yeh, and H.-Y. Lin, "Efficient and exact reliability evaluation for networks with imperfect vertices," IEEE Trans. Reliability, vol. 56, no. 2, pp. 288-300, 2007.
13. W.-C. Yeh, "The extension of universal generating function method to search for all one-to-many d-minimal paths of acyclic multi-state-arcflow- conservation network," IEEE Trans. Reliability, vol. 57, no. 1, pp. 94-102, 2008.
14. W.-C. Yeh, "A fast algorithm for searching all multi-state minimal cuts," IEEE Trans. Reliability, vol. 57, no. 4, pp. 581-588, 2008.
15. Y.-K. Lin, "System reliability evaluation for a multistate supply chain network with failure nodes using minimal paths," IEEE Trans. Reliability, vol. 58, no. 1, pp. 34-40, 2009.