Year: 2026
Type: article
Abstract: 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 structures and properties that allow the algorithm to run in worst-case polynomial running time. We formalise Berge’s lemma, blossoms and their properties, and a mathematical model of the algorithm, showing that it is totally correct. We provide the first detailed proofs of many of the facts underlying the algorithm’s correctness.
Source: Journal of Automated Reasoning
Authors: Mohammad Abdulaziz, Kurt Mehlhorn
Institutions: King's College London, Max Planck Institute for Informatics
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,190
Funder: Deutsche Forschungsgemeinschaft
Award: G653283282
OpenAlex ID: W7129073881