Graph isomorphism problem
Can it be decided in polynomial time whether two graphs are the same up to relabelling?
Summary
Deciding whether two finite graphs are isomorphic is not known to be solvable in polynomial time, nor to be NP-complete.
Source
Open, as listed by Wikipedia · Unsolved problems in computer science. Checked 29 Sep 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.
