minimum vertex cover

minimum vertex cover

[‚min·ə·məm ′vər‚teks ‚kəv·ər]
(mathematics)
A vertex cover in a graph such that there is no other vertex cover with fewer vertices.
Full browser ?