A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
- 1 May 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (2) , 281-297
- https://doi.org/10.1137/0209025
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Forest embeddings in regular graphs of large girthJournal of Combinatorial Theory, Series B, 1981
- Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent ProblemsSIAM Journal on Computing, 1978
- The graph isomorphism diseaseJournal of Graph Theory, 1977
- A four-gadgetACM SIGACT News, 1977
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance MatricesJournal of the ACM, 1976
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- An Efficient Algorithm for Graph IsomorphismJournal of the ACM, 1970
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965