Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Figure 8

The distribution of the objective values for the subgraph isomorphism problem which is shown in Figure 5. The objective values are restricted to discrete values, as the quadratic term can only attain values which are multiples of . With the optimal objective value is 2.0 and the obtained lower bound is , which is a nonisomorphism proof for this problem instance.
908356.fig.008