Question: Show that the following problem is NP complete MAXIMUM COMMON SUBGRAPH input : Two graphs G1 = (V1, E1) and G2 = (V2, E2); a
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
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
