3
$\begingroup$

Is there an algorithm which will allow me to find an isomorphism between two graphs if I have their adjacency lists?

  • 1
    The graph isomorphism problem is unusual in that it is NP but probably not NP-complete and no polynomial-time algorithm is known. The Wikipedia article has references for some state-of-the-art algorithms: http://en.wikipedia.org/wiki/Graph_isomorphism_problem2011-03-30

2 Answers 2