e/Induced subgraph isomorphism problem

Information
has gloss	eng: In complexity theory and graph theory, induced subgraph isomorphism is an NP-complete decision problem that involves finding a given graph as an induced subgraph of a larger graph.
lexicalization	eng: induced subgraph isomorphism problem
instance of	c/Computational problems in graph theory