# Algorithms for finding graph isomorphisms

I was wondering if anybody knows where I can find some information about the current (practical) algorithms for finding graph isomorphisms. I've joined the bandwagon and wrote my own which I would like to compare with the others.

• Also, I came up with an algorithm for computing chromatic polynomials that has a better running time than that employed by MATLAB's MuPad notebook. This is on account of better average branching of my algorithm. Do you have any suggestions of chromatic polynomial computation algorithms with which I can compare my algorithm? – Victor Rielly Mar 26 '16 at 21:59

To compare your implementation with others, I would recommend to benchmark it against sage,igraph and McKay's canonical labelling (IIRC part of the nauty package). The last two are optional packages in sage, so probably installing sage (possibly in a virtual machine) is the easiest way.