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 ...

What’s more, the algorithm is nearly 70 years old and a staple of the undergraduate computer science curriculum ... The algorithm works in an abstracted road map called a graph: a network of ...

“It’s a breakthrough — an amazing result,” said Robert Tarjan, a computer scientist at Princeton University and a winner of the Turing Award, considered the field’s highest honor. The team’s strategy ...

Andrew A. Chien will lead a team of University of Chicago computer science researchers building the UpDown Systema—a new approach that could speed up graph analytics a hundredfold. Graph analytics is ...