TRANSITIVE REDUCTION OF A HLPOTENT
暂无分享,去创建一个
[1] Lawrence Yelowitz. An Efficient Algorithm for Constructing Hierarchical Graphs , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[2] David F. McAllister,et al. Discrete mathematics in computer science , 1977 .
[3] Franz E. Hohn,et al. Boolean matrices and the design of combinational relay switching circuits , 1955 .
[4] Michael A. Harrison,et al. Introduction to switching and automata theory , 1965 .
[5] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..
[6] Franco P. Preparata,et al. Introduction to Discrete Structures for Computer Science and Engineering , 1973 .
[7] Rosalind B. Marimont. Applications of Graphs and Boolean Matrices to Computer Programming , 1960 .
[8] J. M. S. Simoes Pereira. On the Boolean Matrix Equation M ′ =∨ i=1 M i , 1965 .
[9] Lotfi A. Zadeh,et al. Similarity relations and fuzzy orderings , 1971, Inf. Sci..
[10] Gerald L. Thompson,et al. An Algorithm for Finding a Minimum Equivalent Graph of a Digraph , 1969, J. ACM.
[11] George L. Nemhauser,et al. Computer construction of project networks , 1968, CACM.
[12] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[13] Harry T. Hsu,et al. An Algorithm for Finding a Minimal Equivalent Graph of a Digraph , 1975, JACM.
[14] John N. Warfield,et al. On Arranging Elements of a Hierarchy in Graphic Form , 1973, IEEE Trans. Syst. Man Cybern..
[15] Irving M. Copilowish. Matrix Development of the Calculus of Relations , 1948, J. Symb. Log..
[16] I. Anderson,et al. Graphs and Networks , 1981, The Mathematical Gazette.
[17] Ki Hang Kim. Boolean matrix theory and applications , 1982 .
[18] Narsingh Deo,et al. Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.