On the graph isomorphism problem
Computational Complexity
2008-01-10 v3 Discrete Mathematics
Abstract
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
Cite
@article{arxiv.0801.0398,
title = {On the graph isomorphism problem},
author = {Shmuel Friedland},
journal= {arXiv preprint arXiv:0801.0398},
year = {2008}
}
Comments
12 pages