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.

In practice, many algorithms always seem to work efficiently. But in theory, there is no guarantee. In an arXiv preprint, researchers from the Kwan Group at the Institute of Science and Technology ...