Corpus ID: 18007141

Polynomial Time Algorithm for Graph Isomorphism Testing

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

Michael I. Trofimov

Published 2010

Computer Science, Mathematics

ArXiv

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed

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.