International Journal of Combinatorics / 2012 / Article / Fig 6

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 6

Here the relational structure matrix for the example subgraph isomorphism problem that is shown in Figure 5 is depicted.
908356.fig.006

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.