Show that the following problem is NP-complete.
MAXIMUM COMMON SUBGRAPH
Input: Two graphs G1 = (V1, E1 and G2 = (V2, E2); a budget b.
Output: Two set of nodes V′1 ⊆ V1 and V′2 ⊆ V2 whose deletion leaves at least b nodes in each graph, and makes the two graphs identical.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.