---

Maximum matching and minimum vertex cover in bi-partite graphs

---

• Vertex cover
  • Definition: vertex cover

    A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the vertex cover. I.e.: the vertices in a vertex cover will cover all edges