minimum vertex cover
McGraw-Hill Science & Technology Dictionary:
Top
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.
Post a question - any question - to the WikiAnswers community:
Copyrights:
McGraw-Hill Science & Technology Dictionary
McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved.
Read more