Translate:
English
Chinese (S)
Chinese (T)
Croatian
Dutch
French
German
Hebrew
Italian
Japanese
Korean
Portuguese
Russian
Serbian
Spanish
Swedish
Turkish
Additional
Vertex cover
English Wikipedia - The Free Encyclopedia
Download this dictionary
Vertex cover
In the
mathematical
discipline of
graph theory
, a
vertex cover
(sometimes
node 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
.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License