Curvature-based candidate construction plus explicit verification solves graph isomorphism correctly on all tested hard instances in deterministic polynomial time.
On the complexity of canonical labeling of strongly regular graphs.SIAM Journal on Computing, 9(1):212–216
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.comp-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finding Graph Isomorphisms in Heated Spaces in Almost No Time
Curvature-based candidate construction plus explicit verification solves graph isomorphism correctly on all tested hard instances in deterministic polynomial time.