Edge Cover
Jump to navigation
Jump to search
An Edge Cover is a graph set operation that produces a graph edge set such that every vertex of the graph is incident to at least one edge of the set.
- Context:
- It can be produced by a Minimum Edge Cover Task.
- See: Vertex Cover.
References
2013
- http://en.wikipedia.org/wiki/Edge_cover
- 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.