Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD
暂无分享,去创建一个
[1] D. R. Shier,et al. Algorithms for Generating Minimal Cutsets by Inversion , 1985, IEEE Transactions on Reliability.
[2] Michael O. Ball,et al. Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.
[3] C. S. Sung,et al. Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs , 1992 .
[4] V. C. Prasad,et al. Comments on "Enumeration of all minimal cutsets for a node pair in a graph , 1993 .
[5] T. L. Landers,et al. A recursive approach for enumerating minimal cutsets in a network , 1994 .
[6] Sayeed Ahmad. Simple enumeration of minimal cutsets of acyclic directed graph , 1988 .
[7] Alberto Martelli. A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph , 1976, JACM.
[8] S. Arunkumar,et al. Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph , 1979, IEEE Transactions on Reliability.
[9] Douglas R. Shier,et al. Iterative algorithms for generating minimal cutsets in directed graphs , 1986, Networks.
[10] S. Rai,et al. An Efficient Method for Reliability Evaluation of a General Network , 1978, IEEE Transactions on Reliability.
[11] S. Kuo,et al. Determining terminal-pair reliability based on edge expansion diagrams using OBDD , 1999 .
[12] Suresh Rai,et al. Experimental results on preprocessing of path/cut terms in sum of disjoint products technique , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.
[13] U. Abel,et al. Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph , 1982, IEEE Transactions on Reliability.
[14] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[15] Shuji Tsukiyama,et al. An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset , 1980, J. ACM.