Graph isomorphism and automorphism problems are polynomial
Abstract
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization, computational logic, structure recognition, and dynamics of complex systems. Both problems have previously been suspected, but not proven, to be NP-complete. In this paper we propose an algorithm that solves both graph automorphism and isomorphism problems in polynomial time. The algorithm can be easily implemented and thus opens up a wide range of applications.
Keywords
Cite
@article{arxiv.1211.2322,
title = {Graph isomorphism and automorphism problems are polynomial},
author = {Charo I. Del Genio and Thilo Gross},
journal= {arXiv preprint arXiv:1211.2322},
year = {2012}
}
Comments
After appearance of the manuscript on arXiv we received communication from Dr. Matthew Anderson with a counter example. Although we performed extensive tests prior to uploading, the counter example is correct and there seems to be an error in our procedure. We would like to beg the pardon of any colleagues who spent time reading the preprint and once again thank Dr. Anderson for his communication