## Table 1 |
||||||

Scalability results for Wagner’s algorithm, sequential CUTTER, and parallel CUTTER
on scale-free graphs |
||||||

Unweighted |
Weighted |
|||||

size |
1,000 |
2,500 |
10,000 |
1,000 |
2,500 |
10,000 |

W [sec] |
2.14 | 34.33 | 2137.18 | NA | NA | NA |

STR [sec] |
1.18 | 18.42 | 1186.39 | 7.52 | 120.21 | 10524.08 |

PTR [sec] |
1.77 | 1.84 | 3.27 | 2.58 | 6.69 | 114.00 |

STR vs. W |
1.82 | 1.86 | 1.80 | NA | NA | NA |

PTR vs. W |
1.21 | 18.67 | 653.05 | NA | NA | NA |

PTR vs. STR |
0.67 | 10.02 | 362.92 | 2.92 | 17.97 | 92.32 |

W = Wagner’s algorithm, STR = Sequential CUTTER, PTR = Parallel CUTTER, NA = not applicable (Wagner’s algorithm is restricted to unweighted graphs). The first block shows the absolute runtimes and the second gives the relative speed-ups.

Bošnački * et al.*

Bošnački * et al.* *BMC Bioinformatics* 2012 **13**:281 doi:10.1186/1471-2105-13-281