Algorithms for finding directed graph isomorphisms by finite automata
暂无分享,去创建一个
[1] Julian R. Ullmann,et al. An Algorithm for Subgraph Isomorphism , 1976, J. ACM.
[2] Stephen H. Unger,et al. GIT—a heuristic program for testing pairs of directed line graphs for isomorphism , 1964, CACM.
[3] L. Weinberg,et al. A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected Graphs , 1966 .
[4] Julian R. Ullmann,et al. Pattern recognition techniques , 1973 .
[5] F. Harary. The Determinant of the Adjacency Matrix of a Graph , 1962 .
[6] Giorgio Levi,et al. Graph isomorphism: A heuristic edge-partitioning-oriented algorithm , 1974, Computing.
[7] Peter A. Franaszek,et al. Some Distribution-Free Aspects of Paging Algorithm Performance , 1974, JACM.
[8] Douglas C. Schmidt,et al. A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices , 1976, J. ACM.
[9] Narsingh Deo,et al. A new algorithm for digraph isomorphism , 1977 .
[10] Edward H. Sussenguth. A Graph-Theoretic Algorithm for Matching Chemical Structures. , 1965 .
[11] Chao-Chih Yang,et al. A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata , 1978, IEEE Trans. Computers.
[12] Alfs T. Berztiss,et al. A Backtrack Procedure for Isomorphism of Directed Graphs , 1973, JACM.
[13] George I. Davida,et al. Optimum Featurs and Graph Isomorphism , 1974, IEEE Trans. Syst. Man Cybern..
[14] Chao-Chih Yang,et al. Generation of All Closed Partitions on the State Set of a Sequential Machine , 1974, IEEE Transactions on Computers.
[15] John E. Hopcroft,et al. Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.
[16] Gerard Salton,et al. Automatic Information Organization And Retrieval , 1968 .
[17] James Turner,et al. Generalized Matrix Functions and the Graph Isomorphism Problem , 1968 .
[18] A. Proskurowski. Search for a unique incidence matrix of a graph , 1974 .
[19] D. Corneil,et al. An Efficient Algorithm for Graph Isomorphism , 1970, JACM.
[20] FRANK R. MOORE,et al. On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata , 1971, IEEE Transactions on Computers.
[21] Chao-Chih Yang,et al. Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism , 1975, IEEE Trans. Computers.