Lecture notes for “ Analysis of Algorithms ” : Maximum matching in general graphs Lecturer :

Abstract

We present Edmonds’ blossom shrinking algorithm for finding a maximum cardinality matching in a general graph. En route, we obtain an efficient algorithm for finding a minimum vertex cover in a bipartite graph and show that its size is equal to the size of the maximum matching in the graph. We also show that the size of a maximum matching in a general graph… (More)

Topics

  • Presentations referencing similar topics