Tree Isomorphism: O(n) -- canonical form via AHU algorithm. Clearly in P. General Graph ISO: Status UNKNOWN -- believed not NP-Complete, not in P. It is GI-complete (its own complexity class). Best ...

Just five days after posting a retraction, László Babai announced that he had fixed the error in his landmark graph isomorphism algorithm. The back and forth ...

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

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

I applied GRPO to teach Qwen2.5-1.5B-Instruct to solve graph isomorphism. The base model has 0% accuracy on the task (it always outputs "NOT ISOMORPHIC" in 2 tokens), which means GRPO gets zero reward ...

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

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

Abstract: Smart contracts suffer from critical vulnerabilities such as reentrancy attacks, delegate call misuse, and timestamp dependencies, posing significant risks when deployed in smart grids. This ...