A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.

Refining with colors Mathematicians have developed various strategies to compare graphs. Since the 1970s, algorithms have been able to test graph isomorphism, but in exponential time.

Where Graph Theory Meets The Road: The Algorithms Behind Route Planning 33 Comments by: Maya Posch April 4, 2024 ...