A Convex Relaxation Bound for Subgraph Isomorphism
Figure 5
A randomly created subgraph problem instance with and . The two graphs are shown along with their binary adjacency matrices. Is there a subgraph isomorphism? For the shown problem instance we can compute a lower bound larger than 0, which proves that no subgraph isomorphism is present.
