1 exercise

Search tips: start over - to expand, or dig in by adding more tags and revising the query.

104

views

no

votes

Minimum edge cover vs Maximum matching

An edge cover of a graph $G(V,E)$ is a subset $F \subseteq E$ of edges such that every node is incident to at least one…

• GRAPH THEORY
• LINEAR PROGRAMMING

• edge-cover
• matching
• reduction