Polynomial Time Algorithm for Graph Isomorphism Testing

Abstract

Earlier we introduced (M.I.Trofimov, E.A.Smolenskii, Application of the Electronegativity Indices of Organic Molecules to Tasks of Chemical Informatics, Russian Chemical Bulletin 54(2005), 2235-2246. http://dx.doi.org/10.1007/s11172-006-0105-6) effective recursive algorithm for graph isomorphism testing. In this paper we describe used approach and iterative modification of this algorithm, which modification has polynomial time complexity for all graphs.

Extracted Key Phrases

Cite this paper

@article{Trofimov2010PolynomialTA, title={Polynomial Time Algorithm for Graph Isomorphism Testing}, author={Michael I. Trofimov}, journal={CoRR}, year={2010}, volume={abs/1004.1808} }