e/Maximum common subgraph isomorphism problem

Information
has gloss	eng: In complexity theory, maximum common subgraph-isomorphism (MCS) is an optimization problem that is known to be NP-hard. The formal description of the problem is as follows:
lexicalization	eng: Maximum common subgraph isomorphism problem
instance of	c/Computational problems in graph theory