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) .