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

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

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

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

The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest. “In Laci Babai, you have one of the most legendary and fearsome theoretical computer scientists there ever ...

An innovative approach to solving a stubborn, but elementary, question in graph theory — the mathematical study of networks of nodes and their connections — may signal the first major theoretical ...

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

A comprehensive, production-ready implementation of Graph Isomorphism Networks (GIN) for graph classification tasks. This project provides a clean, reproducible, and ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.