For the reverse question — whether graph isomorphism is in P — the evidence is more mixed. On the one hand, there are practical algorithms for graph isomorphism that can’t solve the problem ...

A new algorithm efficiently solves the graph isomorphism problem, computer scientist László Babai announced November 10 at a Combinatorics and Theoretical Computer Science seminar at the ...

Mathematicians have long sought to develop algorithms that can compare any two graphs. In practice, many algorithms always ...

“When corporations or governments are not legally or otherwise incentivized to disclose information about their algorithms, we might consider a different, more adversarial approach,” Diakopoulos ...

It’s often assumed that Dijkstra’s algorithm, or the A* graph traversal algorithm is used, but the reality is that although these pure graph theory algorithms are decidedly influential ...

For the reverse question—whether graph isomorphism is in P—the evidence is more mixed. On the one hand, there are practical algorithms for graph isomorphism that can’t solve the problem ...