.. _clique_to_independentSet:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = true;ODSA.SETTINGS.MODULE_NAME = "clique_to_independentSet";ODSA.SETTINGS.MODULE_LONG_NAME = "Reduction of Clique to Independent Set";ODSA.SETTINGS.MODULE_CHAPTER = "Limits to Computing"; ODSA.SETTINGS.BUILD_DATE = "2018-03-22 17:01:45"; ODSA.SETTINGS.BUILD_CMAP = false;JSAV_OPTIONS['lang']='en';JSAV_EXERCISE_OPTIONS['code']='java';</script>


.. |--| unicode:: U+2013   .. en dash
.. |---| unicode:: U+2014  .. em dash, trimming surrounding whitespace
   :trim:


.. odsalink:: AV/Development/NP/cliqueToISCON.css
.. This file is part of the OpenDSA eTextbook project. See
.. http://algoviz.org/OpenDSA for more details.
.. Copyright (c) 2012-2013 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

.. avmetadata::
   :author: Nabanita Maji
   :topic: NP-completeness

Reduction of Clique to Independent Set
======================================

Clique to Independent Set
-------------------------

The following slideshow shows that an instance of Clique
problem can be reduced to an instance of Independent Set problem 
in polynomial time.
 
.. inlineav:: cliqueToISCON ss
   :points: 0.0
   :required: False
   :threshold: 1.0
   :long_name: Clique to IS Reduction
   :output: show

This reduction can help in providing an NP Completeness proof for 
the Independent Set problem.

.. odsascript:: AV/Development/NP/cliqueToISCON.js