## Table 2 |
||||

Scalability results for Wagner’s algorithm, sequential CUTTER, and parallel CUTTER
on Erdős-Rényi graphs |
||||

Unweighted |
Weighted |
|||

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

W [sec] |
2.46 | 38.93 | NA | NA |

STR [sec] |
1.20 | 18.55 | 5.86 | 91.12 |

PTR [sec] |
1.74 | 1.82 | 2.44 | 6.37 |

STR vs. W |
2.05 | 2.10 | NA | NA |

PTR vs. W |
1.41 | 21.37 | NA | NA |

PTR vs. STR |
0.69 | 10.18 | 2.40 | 14.31 |

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