Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
Quanta Magazine

Complexity Theory Problem Strikes Back

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

ORBIT EQUIVALENCE OF GRAPHS AND ISOMORPHISM OF GRAPH GROUPOIDS

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

Graph-theory breakthrough tantalizes mathematicians

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

MicroAlgo Inc. Develops Multi-Simulator Collaborative Algorithm Based on Subgraph Isomorphism to Enhance Quantum Computer Performance Using Distributed Computing Advantages

SHENZHEN, China, March 17, 2025 /PRNewswire/ -- MicroAlgo Inc. (NASDAQ: MLGO), (the "Company"or "MicroAlgo"), today announced the introduction of an innovative solution: a multi-simulator ...