A new algorithm efficiently solves the graph isomorphism problem ... He says the discovery is potentially the most important theoretical computer science advance in more than a decade.

This is the case with an important problem in computer ... comparison across a large pool of graphs. "Algorithms based on ...

As Aaronson describes it, the algorithm places the problem within ... widely regarded as one of the most important open questions in mathematics. The graph isomorphism problem is neither known to be ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Naturally, finding a route between nodes remained a crucial part of the field, with a wide range of path finding algorithms developed over the centuries. Perhaps the most common graph theory ...