The polynomial algorithm for graphs' isomorphism testing

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.

4 pages

Cited by in corpus (2)

• The $k$-orbit theory and Fein-Kantor-Schacher Theorem
• The graph isomorphism problem is polynomial