Research Article
A Convex Relaxation Bound for Subgraph Isomorphism
Table 1
List of all outcomes of the structure comparison term when two different nodes and of graph are mapped to two different nodes and in the second graph . The first column describes the relation between the concerned nodes and the last column shows the associated cost . Only in cases I and IV is the structure preserved and can lead to an isomorphism. No cost is added in this cases. The other cases (II and III) do not preserve the structure and result in a total cost larger than 0. For details see the text.
| ||||||||||||||||||||||||||||||||||||||||||||||||