International Journal of Combinatorics / 2012 / Article / Fig 8

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 8

The distribution of the objective values for the subgraph isomorphism problem which is shown in Figure 5. The objective values are restricted to discrete values, as the quadratic term can only attain values which are multiples of . With the optimal objective value is 2.0 and the obtained lower bound is , which is a nonisomorphism proof for this problem instance.

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.