Despite how simple the problem is to state, theoretical computer scientists have struggled for more than 30 years to figure out whether there is any computer algorithm that solves graph isomorphism ...

The difficulty of some mathematical problems lies in not knowing how hard they are. This is the case with an important problem in computer science called "graph isomorphism testing" whereby ...

The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest.

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

For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either ...

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