A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Theoretical computer scientists are normally a fairly sedate bunch, but are humming with excitement after a potential breakthrough in a long-standing problem called graph isomorphism. The result could ...

A computer scientist has taken his colleagues on a rollercoaster ride. In the span of several days, László Babai of the University of Chicago walked back his earlier claim of making a major advance on ...