Description:
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 nodesV′1⊆V
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 nodesV′1⊆V