New algorithm cracks graph problem
Computer science ‘advance of decade’ helps identify identical networks
YOU FOLLOW? László Babai describes his new algorithm at the University of Chicago on November 10. The algorithm solves the tricky graph isomorphism problem faster than ever before.
Jeremy Kun
A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable.