Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph theory concept
|
| gptkbp:appliesTo |
Directed graphs
Undirected graphs |
| gptkbp:definedIn |
A set of edges in a graph such that every vertex is incident to at least one edge in the set
|
| https://www.w3.org/2000/01/rdf-schema#label |
Edge Cover
|
| gptkbp:minimumEdgeCover |
An edge cover of smallest possible size
|
| gptkbp:minimumEdgeCoverProblem |
Finding a minimum edge cover is a polynomial-time problem
|
| gptkbp:property |
A minimum edge cover can be found using maximum matching
The size of a minimum edge cover plus the size of a maximum matching equals the number of vertices in a graph without isolated vertices Every connected graph with at least two vertices has an edge cover |
| gptkbp:relatedTo |
gptkb:Vertex_Cover
Matching (graph theory) |
| gptkbp:usedIn |
Scheduling
Resource allocation Network design |
| gptkbp:wikipediaArticle |
https://en.wikipedia.org/wiki/Edge_cover
|
| gptkbp:bfsParent |
gptkb:Vertex_Cover
gptkb:Node_Cover |
| gptkbp:bfsLayer |
7
|