Jindal, Anant; Kochar, Gazal; Pal, Manjish
(arXiv, Cornell University Library, 2011-07)
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs G=(V,E). The best known algorithm for this problem till date runs in O(mn√) time due to Micali and Vazirani \cite{MV80}. ...