Algorithm Solves Graph Isomorphism in Record Time (2015)
<i>even small graphs can be made to look very different just by moving their nodes around</i><p>I'm curious: for the graph isomorphism problem, how are the graphs defined then? It seems there must be a geometric component in there because if they were defined just in terms of abstract sets of vertices and edges between them, it would be rather trivial to show if two graphs are the same, wouldn't it?