New Invariants for the Graph Isomorphism Problem
Data Structures and Algorithms
2015-08-24 v2 Discrete Mathematics
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
Cite
@article{arxiv.1212.3055,
title = {New Invariants for the Graph Isomorphism Problem},
author = {Alexander Gamkrelidze and Gunter Hotz and Levan Varamashvili},
journal= {arXiv preprint arXiv:1212.3055},
year = {2015}
}