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

Theoretical computer scientists are normally a fairly sedate bunch, but are humming with excitement after a potential breakthrough in a long-standing problem called graph isomorphism. The result ...

Algebraic Structures And Isomorphism Problems Publication Trend The graph below shows the total number of publications each year in Algebraic Structures And Isomorphism Problems.

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