An O(n^2.5) Algorithm for Maximum Matching in General Graphs

Shimon Even, Oded Kariv

Browse the full FOCS paper archive.