International Journal of Combinatorics / 2012 / Article / Fig 1

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 1

An illustration of the 0,1-indicator vector with and . The right side shows the indicator vector representation of the particular bipartite matching which is shown on the left hand side of this figure. For each of the mappings the vector contains exactly a single “1” within each of the consecutive partitions with elements.
908356.fig.001

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.