Algorithms for finding a fundamental set of cycles for an undirected linear graph
暂无分享,去创建一个
[1] Stephen H. Unger,et al. GIT—a heuristic program for testing pairs of directed line graphs for isomorphism , 1964, CACM.
[2] F. Harary,et al. The theory of graphs and its applications , 1963 .
[3] T. L. Saaty,et al. Finite graphs and networks : an introduction with applications , 1967 .
[4] Claude Berge,et al. The theory of graphs and its applications , 1962 .
[5] Frank Harary,et al. Finite Graphs and Networks, An Introduction with Applications. , 1967 .
[6] H UngerStephen. GITa heuristic program for testing pairs of directed line graphs for isomorphism , 1964 .
[7] Saul Gorn. Recorded magnetic tape for information interchange (800 CPI, NRZI) , 1966, CACM.
[8] Edward H. Sussenguth. A Graph-Theoretic Algorithm for Matching Chemical Structures. , 1965 .
[9] Kenneth E. Iverson,et al. A programming language , 1899, AIEE-IRE '62 (Spring).
[10] Walter M. Carlson. Toward a National Chemical Information Network. , 1965 .
[11] John T. Welch,et al. A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs , 1966, J. ACM.