Journals
Publish with us
Publishing partnerships
About us
Blog
International Journal of Combinatorics
Table of Contents
International Journal of Combinatorics
/
2012
/
Article
/
Fig 2
/
Research Article
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).