International Journal of Combinatorics / 2012 / Article / Fig 3

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 3

(a) (Case I) adjacent nodes and in the graph are assigned to adjacent nodes and in the graph . (b) (Case II) adjacent nodes and are no longer adjacent in the graph after the assignment. The left mapping leads to no additional costs while the right undesired mapping adds 1 to the total cost.
(a) I: Good assignment (no costs)
(b) II: Bad assignment (costly)

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.