NIST

vertex covering problem

(classic problem)

Definition: See vertex cover.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 8 February 2007.
HTML page formatted Mon Nov 18 10:44:10 2013.

Cite this as:
Paul E. Black, "vertex covering problem", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 8 February 2007. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/vertexCoveringProblem.html