In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set. In computer science, the minimum edge cover problem is the problem of finding an edge cover of minimum size. It is an optimization problem that belongs to the class of covering problems and can be solved in polynomial time.
| Covering-packing dualities | |
| Covering problems | Packing problems |
|---|---|
| Minimum set cover | Maximum set packing |
| Minimum vertex cover | Maximum matching |
| Minimum edge cover | Maximum independent set |
Read more about Edge Cover: Definition, Algorithms
Famous quotes containing the words edge and/or cover:
“Americans see history as a straight line and themselves standing at the cutting edge of it as representatives for all mankind. They believe in the future as if it were a religion; they believe that there is nothing they cannot accomplish, that solutions wait somewhere for all problems, like brides.”
—Frances Fitzgerald (b. 1940)
“When you are listening to music it is better to cover your eyes than your ears.”
—José Bergamín (1895–1983)