Thinh D. Nguyen
Abstract
In this note, we show that graph isomorphism and some of its variant are both reducible to circuit isomorphism problem, in polynomial time.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this note, we show that graph isomorphism and some of its variant are both reducible to circuit isomorphism problem, in polynomial time.
Key concepts: Graph isomorphism, Isomorphism (crystallography), Induced subgraph isomorphism problem, Graph automorphism, Subgraph isomorphism problem, Mathematics, Isomorphism extension theorem, Combinatorics