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
I recently came across the following paper : http://arxiv.org/abs/0711.2010 This paper proposes "A Polynomial Time Algorithm for Graph Isomorphism"