International Journal of Combinatorics / 2012 / Article / Tab 5

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Table 5

None of the upper bounds for the maximum clique size comes close to the trivial bound that is inherent in the reformulation of the largest common subgraph problem into the maximum clique problem. The clique bounds are computed for the equivalent maximum clique formulation of the same 1000 problems used in Table 4.

BoundK/L Mean bound Min. Max

7/15 53.31 74.55
7/15 30.69 54.34
7/15 32 54
7/15 52.50 54.50

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.