Assertion: subgraph isomorphism | /r/HasProperty | formulated as a decision problem
Facets:
Source sentences:
text: To prove subgraph isomorphism is NP-complete, it must be formulated as a decision problem.