Assertion: subgraph isomorphism | /r/HasProperty | np-complete
Facets:
Source sentences:
text: To prove subgraph isomorphism is NP-complete, it must be formulated as a decision problem.
text: Since the clique problem is NP-complete, this polynomial-time many-one reduction shows that subgraph isomorphism is also NP-complete.