Re: difference between graph isomorphism and subgraph isomorphism
Date: June 23, 2018 02:25AM
In frequent subgraph mining, you typically have edges and vertices that have names. For example, you could have a graph about a water molecule, and you would have two nodes that have the same label "Hydrogen" and one node with the label "Oxygen"
Hydrogen ---- Oxygen ----- Hydrogen
Now, when you check if two graphs are isomorphic, yes, you need to check that the structure match but also the names (labels). And if you have label on the edges, you also need to check the labels on the edges.