article

Free access

An Efficient Algorithm for Graph Isomorphism

Authors:

D. G. Corneil,

C. C. GotliebAuthors Info & Claims

Journal of the ACM (JACM), Volume 17, Issue 1

Pages 51 - 64

https://doi.org/10.1145/321556.321562

Published: 01 January 1970 Publication History

PDF eReader

References

[1]

LYNCH, M.F. Storage and retrieval of information on chemical structures by computer. Endeavour 27, 101 (May 1968), 68-73.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

[3]

SUSSENGUTH, E., JR. A graph theoretical algorithm for matching chemical structures. J. Chem. Doc. 5, 1 (Feb. 1965), 36-43.

Crossref

Google Scholar

[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.

Crossref

Google Scholar

[7]

GOETHALS, J. M., AND SEIDEL, J .J . Orthogonal matrices with zero diagonal. Canad. J. Math. 19 (1967), 1001-1010.

Crossref

Google Scholar

[8]

SMOLENSKII, Y.A. A method for the linear recording of graphs. USSR Comput. Math. and Math. Phys. 2 (1963), 396-397.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

Cited By

View all

An XLi LYang XLuo M(2024)Portable network resolving huge-graph isomorphism problemMachine Learning: Science and Technology10.1088/2632-2153/ad7d5f5:3(035084)Online publication date: 30-Sep-2024
https://doi.org/10.1088/2632-2153/ad7d5f
Majhi SWenk C(2024)Distance measures for geometric graphsComputational Geometry10.1016/j.comgeo.2023.102056118(102056)Online publication date: Mar-2024
https://doi.org/10.1016/j.comgeo.2023.102056
Cook S(2023)The Complexity of Theorem-Proving ProceduresLogic, Automata, and Computational Complexity10.1145/3588287.3588297(143-152)Online publication date: 23-May-2023
https://dl.acm.org/doi/10.1145/3588287.3588297
Show More Cited By

Index Terms

An Efficient Algorithm for Graph Isomorphism
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction
2. Mathematics of computing
  1. Discrete mathematics

Recommendations

Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing

The isomorphism problem for graphs G₁ and G₂ is to determine if there exists a one-to-one mapping of the vertices of G₁ onto the vertices of G₂ such that two vertices of G₁ are adjacent if and only if their images in G₂ 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 Recognition

In 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

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1970

Published in JACM Volume 17, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

236
Total Citations
View Citations
5,045
Total Downloads

Downloads (Last 12 months)536
Downloads (Last 6 weeks)65

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

An XLi LYang XLuo M(2024)Portable network resolving huge-graph isomorphism problemMachine Learning: Science and Technology10.1088/2632-2153/ad7d5f5:3(035084)Online publication date: 30-Sep-2024
https://doi.org/10.1088/2632-2153/ad7d5f
Majhi SWenk C(2024)Distance measures for geometric graphsComputational Geometry10.1016/j.comgeo.2023.102056118(102056)Online publication date: Mar-2024
https://doi.org/10.1016/j.comgeo.2023.102056
Cook S(2023)The Complexity of Theorem-Proving ProceduresLogic, Automata, and Computational Complexity10.1145/3588287.3588297(143-152)Online publication date: 23-May-2023
https://dl.acm.org/doi/10.1145/3588287.3588297
Peyerimhoff NRoth MSchmitt JStix JVdovina AWellnitz P(2023)Parameterized Counting and Cayley Graph ExpandersSIAM Journal on Discrete Mathematics10.1137/22M147980437:2(405-486)Online publication date: 26-Apr-2023
https://doi.org/10.1137/22M1479804
N AB KS SH SPuri SA R(2023)Simplifying Structure and Pattern in Complex Social Networks Using Graph Isomorphism2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT)10.1109/ICCCNT56998.2023.10307326(1-7)Online publication date: 6-Jul-2023
https://doi.org/10.1109/ICCCNT56998.2023.10307326
Llanes AImbernón Tudela BCurado MSoto J(2023)ISOMORPH: an efficient application on GPU for detecting graph isomorphismEngineering Computations10.1108/EC-07-2022-047640:7/8(1807-1818)Online publication date: 6-Sep-2023
https://doi.org/10.1108/EC-07-2022-0476
MacDonald S(2023)The road problem and homomorphisms of directed graphsTheoretical Computer Science10.1016/j.tcs.2023.113981968:COnline publication date: 11-Aug-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.113981
Bok JFiala JJedličková NKratochvíl JSeifrtová M(2023)Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)Graph-Theoretic Concepts in Computer Science10.1007/978-3-031-43380-1_8(101-115)Online publication date: 28-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-43380-1_8
Abiad AHojny CZeijlemaker S(2022)Characterizing and computing weight-equitable partitions of graphsLinear Algebra and its Applications10.1016/j.laa.2022.03.003645(30-51)Online publication date: Jul-2022
https://doi.org/10.1016/j.laa.2022.03.003
Akitaya HLöffler MParada I(2022)How to Fit a Tree in a BoxGraphs and Combinatorics10.1007/s00373-022-02558-z38:5Online publication date: 1-Oct-2022
https://dl.acm.org/doi/10.1007/s00373-022-02558-z
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

Efficient Suboptimal Graph Isomorphism

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations