Andere Kunden interessierten sich auch für
![Vertex Arrangement]( "Vertex Arrangement")
Vertex Arrangement22,99 €![Vertex (Graph Theory)]( "Vertex (Graph Theory)")
Vertex (Graph Theory)22,99 €![K-Vertex-Connected Graph]( "K-Vertex-Connected Graph")
K-Vertex-Connected Graph19,99 €![Projective Cover]( "Projective Cover")
Projective Cover19,99 €![Vertex Enumeration Problem]( "Vertex Enumeration Problem")
Vertex Enumeration Problem19,99 €![Vertex Operator Algebra]( "Vertex Operator Algebra")
Vertex Operator Algebra22,99 €![Vertex coloring]( "Vertex coloring")
Vertex coloring32,99 €
High Quality Content by WIKIPEDIA articles! In 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. Its decision version, the vertex cover problem was one of Karp's 21 NP-complete problems and is therefore a classical NP-complete problem in computational complexity theory. Furthermore, the vertex cover problem is fixed-parameter tractable and a central problem in parameterized complexity theory. The minimum vertex cover problem can be formulated as a half-integral linear program whose dual linear program is the maximum matching problem.