A Convex Relaxation Bound for Subgraph Isomorphism

Figure 2

An example graph and its adjacency matrix 𝑁_𝐾 along with its complementary counterpart 𝑁_𝐾. The matrices are represented as an appropriate binary image (0 = black, 1 = white).