International Journal of Combinatorics / 2012 / Article / Tab 2

Research Article

A Convex Relaxation Bound for Subgraph Isomorphism

Table 2

Mean computation time for three SDP solvers needed to solve the SDP relaxations of our experiments. The CSDP-solver fits best our needs.

Problem size (K/L)CSDP 6.0.1 DSDP 5.8 PENSDP 2.2

7/15 ( )s ( )s ( )s

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.