Edge cover

（重定向自Edge covering number）

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.

单词	Edge covering number
释义	Edge covering number 英语百科 Edge cover （重定向自Edge covering number） 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.
随便看	chain ends chain endtoend vector chain end to end vector chain entanglement chain equipment chain equivalence chain equivalent chainequivalent solute viscosity factor chain equivalent solute viscosity factor chain error chaines papillon chaines tours chainet chainette chainette tower chain excavator chain exhaust box chain expansion factor chain explosion chain extender chain extending reaction chain extendor chain, extensible chain extension chain extension agent