Deterministic n O(n) Graph Isomorphism Algorithm via Inherited Decompositions
cs.DS
Submitted: 2026-11-01
Updated: 2026-11-10
Code: https://github.com/mahdi-jfri/GraphIsomorphismLog2
Terminology
Sources
- On Graph Isomorphism Problem
- Graph isomorphisms in quasi-polynomial time
- Quotients of permutation groups by nonabelian minimal normal subgroups
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time