Answers are grounded in this paper and cite their sources.
We consider the maximum cardinality matching problem in general graphs, and give an n²⁺ᵒ⁽¹⁾-time algorithm for the problem. Our work builds on recent work on combinatorial algorithms for maximum flow and extends the techniques to skew-symmetric flow problems which capture general matchings as a special case.
No takes yet. Share an insight, caveat, or question.
Li et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: