1 citations · 1 across the 1 of their papers we have counts for
1 paper
Anant Jindal, Gazal Kochar, Manjish Pal
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 $…