Graph Isomorphism

Question

Is there an algorithm or heuristics for graph isomorphism?

Corollary: A graph can be represented in different different drawings.

What s the best approach to

Answer 1

• nauty and Traces

nauty and Traces are programs for computing automorphism groups of graphs and digraphs [*]. They can also produce a canonical label. They are written in a portable subset of C, and run on a considerable number of different systems.

• AutGroupGraph command in GRAPE's package of GAP.
• bliss: another symmetry and canonical labeling program.
• conauto: a graph ismorphism package.