Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2003, Pages 1341-1346

  Lin, Hung Yau ^a   Kuo, Sy Yen ^a   Yeh, Fu Min ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b CHUNG SHAN INSTITUTE OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH DENSITY; LATTICE NETWORKS; MINIMAL CUTSETS; NETWORK RELIABILITY; NETWORK RELIABILITY EVALUATION; ORDERED BINARY DECISION DIAGRAMS; RECURSIVE ALGORITHMS; UNDIRECTED GRAPH;

ALGORITHMS; COMMUNICATION; RELIABILITY;

DIRECTED GRAPHS;

EID: 84883882983     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2003.1214299     Document Type: Conference Paper

References (15)

1. S. Rai and K. K Aggarwal, "An Efficient Method for Reliability Evaluation of a General Network, " IEEE Trans. Reliability, vol. 27, pp. 206-211, Aug 1978.
2. S. Soh and S. Rai, "Experimental Results on Preprocessing of Path/Cut Terms in Sum of Disjoint Products Techniques, " IEEE Trans. Reliability, vol. R-42, no. 1, pp. 24-33, Mar 1993.
3. R. E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation, " IEEE Trans. Computers, vol. C-35, no. 8, pp. 677-791, Aug 1986.
4. Sy-Yen Kuo, Shyue-Kung Lu, and Fu-Min Yeh, "Determining Terminal-Pair Reliability Based on Edge Expansion Diagrams Using OBDD, " IEEE Trans. Reliability, vol. 48, pp. 234-246, Sep 1999.
5. Alberto Martelli, "A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph, " Journal of A. C. M., vol. 23, pp. 58-73, Jan 1976.
6. S. Arunkumar and S. H. Lee, "Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph, " IEEE Trans. Reliability, vol. 28, pp. 51-55, Apr 1979.
7. S. Tsukiyama, I. Shirakawa, and H. Ozaki, "An Algorithm to Enumerate All Cutsets of a Graph in Linear Time Per Cutset, " Journal of A. C. M., vol. 27, no. 4, pp. 619-632, Oct 1980.
8. U. Abel and R. Bicker, "Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph, " IEEE Trans. Reliability, vol. R-31, no. 2, pp. 167-171, Jun 1982.
9. C. S. Sung and B. K. Yoo, "Simple Enumeration of Minimal Cutsets Separating 2 Vertices in a Class of Undirected Planar Graphs, " IEEE Trans. Reliability, vol. R-41, no. 1, pp. 63-71, Mar 1992.
10. D. R. Shier and D. E. Whited, "Algorithms for Generating Minimal Cutsets by Inversion, " IEEE Trans. Reliability, vol. 34, pp. 314-319, Oct 1985.
11. D. R. Shier and D. E. Whited, "Iterative Algorithms for Generating Minimal Cutsets in Directed Graphs, " Networks, vol. 16, pp. 133-147, 1986.
12. S. H. Ahmad, "Simple Enumeration of Minimal Cutsets of Acyclic Directed Graph, " IEEE Trans. Reliability, vol. R-37, no. 5, pp. 484-487, Dec 1988.
13. L. Yan, and H. A. Taha, "A Recursive Approach for Enumerating Minimal Cutsets in a Network, " IEEE Trans. Reliability, vol. 43, pp. 383-388, Sep 1994.
14. V. Sankar, V. C. Prasad, and K. S. Parakasa Rao, "Comment on: Enumeration of All Minimal Cutsets for a Node Pair in a Graph, " IEEE Trans. Reliability, vol. R-42, no. 1, pp. 44-45, Mar 1993.
15. M. O. Ball, "Computational Complexity of Network Reliability Analysis: An overview, " IEEE Trans. Reliability, vol. 35, pp. 230-239, Aug 1986.