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

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...

The Graph Isomorphism Problem is the computational problem of determining whether two finite graphs are isomorphic. I chose to represent the graphs using an adjacency matrix, this way I can easily ...

Abstract: A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

Abstract: The graph neural networks (GNNs) have drawn much attention for predicting the remaining useful life (RUL) due to their excellent performance in processing correlation relationship among data ...

This example: python3 main.py -i torus24.grl -c 1 will compute the number of automorphism for the graphs found in the provided file.