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 seem to work efficiently. But in theory, there is no guarantee.

This visualization lets you see and hear fifteen different algorithms sift their way through a jumbled mess of data—and it’s truly mesmerizing. The video shows the process—and matched ...