| Information | |
|---|---|
| has gloss | eng: In the mathematical discipline of 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. |
| lexicalization | eng: edge cover |
| instance of | c/Computational problems in graph theory |
| Meaning | |
|---|---|
| Italian | |
| lexicalization | ita: Edge cover |
| Media | |
|---|---|
| media:img | Edge-cover.svg |
| media:img | Minimum-edge-cover-from-maximum-matching.svg |
| media:img | Minimum-edge-cover.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint
