International Journal of Combinatorics / 2012 / Article / Fig 4

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 4

(a) (Case III) a pair of nodes and becomes neighbours and after the assignment. This undesired assignment adds 1 to the costs. (b) (Case IV) nodes and which are not adjacent in the object graph are assigned to nodes which are also not adjacent in the scene graph . This assignment is associated with no additional cost in (5.6).
(a) III: Bad assignment (costly)
(b) IV: Good assignment (no costs)

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.