Close
Register
Close Window

Data Structures and Algorithms

Chapter 11 Limits to Computing (optional)

Show Source |    | About   «  11.16. Reduction of Clique to Independent Set (optional) (WORK IN PROGRESS)   ::   Contents   ::   11.18. Reduction of 3-SAT to Hamiltonian Cycle (optional) (WORK IN PROGRESS)  »

11.17. Reduction of Independent Set to Vertex Cover (optional) (WORK IN PROGRESS)

11.17.1. Independent Set to Vertex Cover

The following slideshow shows that an instance of Independent Set problem can be reduced to an instance of Vertex Cover problem in polynomial time.

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

This reduction can help in providing an NP Completeness proof for the Vertex Cover problem.

   «  11.16. Reduction of Clique to Independent Set (optional) (WORK IN PROGRESS)   ::   Contents   ::   11.18. Reduction of 3-SAT to Hamiltonian Cycle (optional) (WORK IN PROGRESS)  »

nsf

© Copyright 2016 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Nov 16, 2022. Created using Sphinx 2.4.4.
Close Window