Journals
Publish with us
Publishing partnerships
About us
Blog
International Journal of Combinatorics
Table of Contents
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