1 paper · 1 filter
Mohammad Abdulaziz, Kurt Mehlhorn
We present the first formal correctness proof of Edmonds' blossom shrinking algorithm for maximum cardinality matching in general graphs. We focus on formalising the mathematical s…