.. This file is part of the OpenDSA eTextbook project. See
.. http://opendsa.org for more details.
.. Copyright (c) 2012-2020 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

.. avmetadata::
   :title: The Vertex Cover Problem
   :author: Nabanita Maji
   :institution: Virginia Tech
   :topic: NP-completeness
   :keyword: NP-Complete; Vertex Cover Problem
   :naturallanguage: en
   :programminglanguage: N/A
   :description: Presents the Vertex Cover problem. Includes a practice exercise where the user must determine the minimum vertex cover in a given graph.

The Vertex Cover Problem
========================

Vertex Cover
------------

.. inlineav:: vertexCoverCON ss
   :long_name: Vertex Cover
   :links: AV/NP/vertexCoverCON.css
   :scripts: AV/NP/vertexCoverCON.js
   :output: show
   :keyword: NP-completeness; Vertex Cover Problem

Try out an instance of the Vertex Cover problem on your own.

.. avembed:: Exercises/NP/vertexCoverPRO.html ka
   :long_name: Practice Exercise for Vertex Cover
   :keyword: NP-completeness; Vertex Cover Problem