The polynomial algorithm for graphs' isomorphism testing

2002/02/09 by Aleksandr Golubchik, Golubchik, Aleksandr
Computer Science · Engineering · Mathematics · #Advanced Data Processing Techniques #Combinatorics (math.CO) #Conbinatorics #FOS: Mathematics #Graph Theory and Algorithms #Graph theory #Group Theory (math.GR) #Group theory #Software Testing and Debugging Techniques #math.CO #math.GR

paper · pdf · doi:10.48550/arxiv.math/0202085

4 pages

arxiv created 2002/02/09 · openalex publication_date 2002/02/09 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

Related

• Polynomial Time Algorithm for Graph Isomorphism Testing
• Isomorphism of graphs-a polynomial test
• A Polynomial Time Algorithm for Graph Isomorphism
• Isomorphism Testing for Graphs of Bounded Rank Width
• The graph isomorphism problem is polynomial