D. G. Corneil
- 1 LYNCH, M.F. Storage and retrieval of information on chemical structures by computer. Endeavour 27, 101 (May 1968), 68-73.Google Scholar
Cross Ref
- 2 UNGER, S. H. GIT--a heuristic program for testing pairs of directed line graphs for isomorphism. Comm. ACM 7, 1 (Jan. 1964), 26-34. Google ScholarDigital Library
- 3 SUSSENGUTH, E., JR. A graph theoretical algorithm for matching chemical structures. J. Chem. Doc. 5, 1 (Feb. 1965), 36-43.Google ScholarCross Ref
- 4 B~HM, C., AND SANTOLINI, A. A quasi-decision algorithm for the p-equivalence of two matrices. ICC Bull. 8, 1 (1964), 57-69.Google Scholar
- 5 , CORNEIL, D.G. Graph Isomorphism. Ph.D. thesis, U. of Toronto, Canada, 1968.Google Scholar
- 6 BOSE, R.C. Strongly regular graphs, partial geometries, and partially balanced designs. Pacific J. Math. 18 (1963), 389-420.Google ScholarCross Ref
- 7 GOETHALS, J. M., AND SEIDEL, J .J . Orthogonal matrices with zero diagonal. Canad. J. Math. 19 (1967), 1001-1010.Google ScholarCross Ref
- 8 SMOLENSKII, Y.A. A method for the linear recording of graphs. USSR Comput. Math. and Math. Phys. 2 (1963), 396-397.Google ScholarCross Ref
- 9 BUSACKER, R., AND SAATY, W. Finite Graphs and Networks--An Introduction with Applications. McGraw-Hill, New York, 1965, 196-199.Google Scholar
- 10 GOTLIEB, C. C., AND CORNEIL, D.G. Algorithms for finding a fundamental set of cycles for an undirected linear graph. Comm. ACM 10, 12 (Dec. 1967), 780-783. Google ScholarDigital Library
Index Terms
- An Efficient Algorithm for Graph Isomorphism
Recommendations
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computingThe isomorphism problem for graphs G1 and G2 is to determine if there exists a one-to-one mapping of the vertices of G1 onto the vertices of G2 such that two vertices of G1 are adjacent if and only if their images in G2 are adjacent. In addition to ...
Efficient Suboptimal Graph Isomorphism
GbRPR '09: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern RecognitionIn the field of structural pattern recognition, graphs provide us with a common and powerful way to represent objects. Yet, one of the main drawbacks of graph representation is that the computation of standard graph similarity measures is exponential in ...
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Comments