论文信息 - A Fortran IV Program for Finding the Smallest Set of Smallest Rings of a Graph - 字舞流文

A Fortran IV Program for Finding the Smallest Set of Smallest Rings of a Graph

BURGHARDT SCHMIDT | JORG FLEISCHHAUER

[1] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.

[2] Morris Plotkin,et al. Mathematical Basis of Ring-Finding Algorithms in CIDS , 1971 .

[3] Calvin C. Gotlieb,et al. Algorithms for finding a fundamental set of cycles for an undirected linear graph , 1967, CACM.

[4] E J Corey,et al. Computer-assisted design of complex organic syntheses. , 1969, Science.

[5] John T. Welch,et al. A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs , 1966, J. ACM.

[6] E. J. Corey,et al. Algorithm for machine perception of synthetically significant rings in complex cyclic organic structures , 1972 .