Gazal Kochar

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs G = (V, E). This problem has been studied extensively more than four decades. The best known algorithm for this problem till date runs in O(m √ n) time due to Micali and Vazirani [24]. Even for general bipartite graphs this is the best known running time(More)
  • 1