1. Vertex coverIn the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical optimization problem in computer science and is a typical example of an NP-hard optimization problem that has an approximation algorithm.
Read “Vertex cover” on English Wikipedia
Read “頂点被覆” on Japanese Wikipedia
Read “Vertex cover” on DBpedia
Read “Vertex cover” on English Wikipedia
Read “頂点被覆” on Japanese Wikipedia
Read “Vertex cover” on DBpedia
Discussions
Log in to talk about this word.