New Invariants for the Graph Isomorphism Problem
classification
💻 cs.DS
cs.DM
keywords
graphcomputegraphsinvariantsalgorithmanswerdegreesfinite
read the original abstract
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other well-known methods could not compute (such as special Furer Gadgets and point-line incidence graphs of finite projective planes of higher degrees
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.