But already in 1980, another classical theorem—the Babai-Erdős-Selkow theorem—showed that almost all graphs can be relabeled to make easy isomorphism testing possible.

Babai's talks sketch a proof that shows that the graph isomorphism problem — determining whether two graphs are the same — can be solved much more quickly than was previously known.

The main challenge here lies in devising a mathematically acceptable proof of this impossibility, which is where the foundations for what we today know as graph theory.

Mechanism and Machine Theory (2023). [2] An efficient approach of graph isomorphism identification using loop theory and hopfield neural networks. Multimedia Tools and Applications (2023).

Abstractions blog Complexity Theory Problem Strikes Back The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. Lucy Reading-Ikkanda for Quanta Magazine The ...

Computer Science Landmark Algorithm Breaks 30-Year Impasse Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. The “graph isomorphism” ...

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also ...