Assertion: isomorphism | /r/CapableOf | imply easy solution
Facets:
value: to the challenging graph isomorphism problem
type: TRANSITIVE-OBJECT
Source sentences:
text: A graph invariant I(G) is called complete if the identity of the invariants I(G) and I(H) implies the isomorphism of the graphs G and H. Finding an efficiently-computable such invariant (the problem of graph canonization) would imply an easy solution to the challenging graph isomorphism problem.