Assertion: graph isomorphism | /r/HasProperty | hard
Facets:
value: in the sense
type: OTHER
Source sentences:
text: Yes, graph isomorphism on regular graphs is hard, in the sense that we already have a reference that shows it's GI-complete (although the degree must be unbounded, since graphs of bounded degree have a polytime algorithm).