International Journal of Combinatorics / 2012 / Article / Tab 3

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Table 3

Bounds for the example problem. The largest clique that can be obtained in the related maximum clique problem is and the lower bound translates to the fact that the size of the maximum clique must be lower than , providing a tight upper bound (ubnd) .

(7.1) (8.6) (8.7) (8.8) (8.9)

7 1050.346 6 0.855 61.602 38.344 35 52.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 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.