Maximum Matching Benchmark: Blossom vs Micali-Vazirani vs Blum — Criterion Results

Read full text Summarise with VIRAT
Authors: Luca Cappelletti
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Raw Criterion.rs benchmark results comparing four maximum matching algorithms (Blossom (Edmonds, 1965), Gabow (1976), Micali-Vazirani (1980), and Hopcroft-Karp (1973)) from the `geometric-traits` Rust crate, across 112 graph configurations spanning 36 benchmark groups (941 individual measurements). The tarball contains the full `target/criterion/` output tree: HTML reports, SVG plots, and raw JSON estimates (`estimates.json`) for every configuration. Benchmark source code and analysis are in the companion repository. Machine: AMD Ryzen Threadripper PRO 5975WX (32 cores), 1 TB RAM, Ubuntu 24.04, rustc 1.96.0-nightly (2026-03-01). Repository: https://github.com/LucaCappelletti94/maximal-matching-benchmark Commit: aeb55f8

Fields of Study & Subjects

Complexity and Algorithms in Graphs Graph Theory and Algorithms Algorithms and Data Compression

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
22 March 2026
Language
EN
Document type
Dataset