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
  • 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. 

    References

    SHOWING 1-10 OF 22 REFERENCES
    Graph isomorphism, general remarks
    • G. Miller
    • Mathematics, Computer Science
    • STOC '77
    • 1977
    • 86
    A Polynomial Time Algorithm for Graph Isomorphism
    • 9
    • PDF
    The graph isomorphism disease
    • 503
    The Graph Isomorphism Problem: Its Structural Complexity
    • 487
    • PDF
    Isomorphism of Planar Graphs
    • 149
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 46,729
    • PDF
    Application of the electronegativity indices of organic molecules to tasks of chemical informatics
    • 10
    Further annotated bibliography on the isomorphism disease
    • G. Gati
    • Mathematics, Computer Science
    • J. Graph Theory
    • 1979
    • 70
    Data Structures and Algorithms
    • 2,140
    • Highly Influential