Graph isomorphism: A heuristic edge-partitioning-oriented algorithm

This publication has 7 references indexed in Scilit:

• Approximation des equations d'evolution du premier ordre ent par des schemas a un degre de liberte
  Calcolo, 1972
• Isomorfismo fra grafi: Un algoritmo efficiente per trov are tutti gli isomorfismi
  Calcolo, 1971
• Un metodo euristico per la verifica dell'isomorfismo di due grafi semplici non orientati
  Calcolo, 1971
• An Efficient Algorithm for Graph Isomorphism
  Journal of the ACM, 1970
• Orthogonal Matrices with Zero Diagonal
  Canadian Journal of Mathematics, 1967
• A Graph-Theoretic Algorithm for Matching Chemical Structures.
  Journal of Chemical Documentation, 1965
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
  Communications of the ACM, 1964