International Journal of Combinatorics / 2012 / Article / Fig 7

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 7

The shown matrix indicates all matrix elements (here in black) that are forced to be zero within the solution matrix for an example problem of the size , . A single constraint forces two symmetric elements in (the enlarged) matrix to be zero.

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 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.