<p>I recently came across the following paper : <a href="http://arxiv.org/abs/0711.2010" rel="nofollow">http://arxiv.org/abs/0711.2010</a> 
This paper proposes "A Polynomial Time Algorithm for Graph Isomorphism"</p>
Graph Isomorphism
<p>Is there an algorithm or heuristics for graph isomorphism?</p>

<p>Corollary: A graph can be represented in different different drawings.</p>

<p>What s the best approach to find different drawing of a graph?</p>