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} }
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.
Topics from this paper
References
SHOWING 1-10 OF 22 REFERENCES
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Computer Science, Mathematics
- 1978
- 47,254
- PDF
Application of the electronegativity indices of organic molecules to tasks of chemical informatics
- Chemistry
- 2005
- 10
Further annotated bibliography on the isomorphism disease
- Mathematics, Computer Science
- J. Graph Theory
- 1979
- 71