Skip to content
Jared Beck edited this page Feb 15, 2015 · 11 revisions

All benchmarks performed on a 3.06 GHz Intel Core i3 with 12 GB 1333 MHz DDR3, using ruby 2.2.0, unless stated otherwise.

Benchmarks on complete graphs give a reasonable upper bound, while sparse graphs are more representative of real-world problems.

  • Maximum Cardinality Matching
    • Bigraphs
    • General Graphs
  • Weighted Matching
    • Bigraphs
    • General Graphs
Clone this wiki locally