A new algorithm to compute vertex cutsets in a graph
暂无分享,去创建一个
[1] S. R. Das,et al. An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation , 1971, IEEE Transactions on Computers.
[2] G. Chartrand. A Graph-Theoretic Approach to a Communications Problem , 1966 .
[3] Narsingh Deo,et al. Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.
[4] Insley B. Pyne,et al. The Reduction of Redundancy in Solving Prime Implicant Tables , 1962, IRE Trans. Electron. Comput..
[5] A. K. Choudhury,et al. Some Studies on Connected Cover Term Matrices of Switching Functions , 1965 .
[6] P. Srimani,et al. Generation of directed circuits in a directed graph , 1979, Proceedings of the IEEE.
[7] Robert T. Chien,et al. Synthesis of a Communication Net , 1960, IBM J. Res. Dev..
[8] Frank Harary,et al. Graph Theory , 2016 .
[9] A. C. Nelson,et al. A Computer Program for Approximating System Reliability , 1970 .
[10] Necessary and Sufficient Conditions for Realizability of Vertex-Weighted Communication Nets , 1969 .
[11] I. Frisch,et al. Algorithms to Realize Directed Communication Nets , 1967, IEEE Transactions on Circuit Theory.
[12] On the Analysis of Weighted Communication Nets , 1969 .
[13] B. R. Myers,et al. Proper flow paths in vertex-weighted communication nets , 1968 .
[14] Alberto Martelli. A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph , 1976, JACM.
[15] Paul A. Jensen,et al. An Algorithm to Determine the Reliability of a Complex System , 1969 .