Problem: Graph canonisation

Definition:
Input: A graph G in this class.
Output: A graph C(G) such that C(G) = C(H) iff G is isomorphic to H.

Linear

Polynomial

GI-complete

NP-hard

NP-complete

coNP-complete

Open

Unknown to ISGCI