Close
Register
Close Window

OpenDSA Data Structures and Algorithms Modules Collection

Chapter 28 Limits to Computing

Show Source |    | About   «  28.16. Reduction of Clique to Independent Set   ::   Contents   ::   28.18. Reduction of 3-SAT to Hamiltonian Cycle  »

28.17. Reduction of Independent Set to Vertex Cover

28.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.

   «  28.16. Reduction of Clique to Independent Set   ::   Contents   ::   28.18. Reduction of 3-SAT to Hamiltonian Cycle  »

nsf

© Copyright 2011-2023 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Oct 01, 2023. Created using Sphinx 4.4.0.
Close Window