Polynomial Time Algorithm for Graph Isomorphism Testing

2010/04/11 by Michael I. Trofimov, M. I. Trofimov, Trofimov, Michael I. · 1 voice
Chemistry · Computer Science · Mathematics · #Advanced Graph Neural Networks #Algorithm #Chemistry #Combinatorics #Computer science #Discrete mathematics #Graph #Graph Theory and Algorithms #Graph isomorphism #Isomorphism (crystallography) #Line graph #Mathematics #Software Testing and Debugging Techniques #Time complexity #cs.DS

paper · pdf · doi:10.48550/arxiv.1004.1808

published in arXiv (Cornell University) (Cornell University) · 20 pages, 7 figures

openalex publication_date 2010/04/11 · arxiv created 2013/06/18 · arxiv updated 2013/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This article deals with new polynomial time algorithm for graph isomorphism testing.

Citations

• Application of the electronegativity indices of organic molecules to tasks of chemical informatics
• Further annotated bibliography on the isomorphism disease
• The graph isomorphism disease
• A Polynomial Time Algorithm for Graph Isomorphism

Discussions

• Polynomial Time Algorithm for Graph Isomorphism Testing [hn, 19 points, 20 comments]

Related

• The polynomial algorithm for graphs' isomorphism testing
• A Polynomial Time Algorithm for Graph Isomorphism
• Isomorphism of graphs-a polynomial test
• Graph isomorphism testing boosted by path coloring
• Recent Advances on the Graph Isomorphism Problem