Just five days after posting a retraction, László Babai announced that he had fixed the error in his landmark graph isomorphism algorithm. The back and forth ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

A novel concept of quantifying graph non-isomorphism is introduced to measure structural differences between graphs, and thus overcoming the strict limitations of traditional graph isomorphism tests.

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...