Polynomial-Time Reductions for NP-Complete Problems
Classified in Computers
Written on in
English with a size of 3.67 KB
1. Independent Set to Vertex Cover Reduction
Input
A graph G and an integer k.
Reduction Steps
- Call the black-box for Vertex Cover with the input graph G.
- Provide n-k as the target size, where n is the number of nodes in G.
- Return the result ('yes' or 'no') from the black-box call.
2. SAT to Independent Set Reduction
Input
A CNF formula F.
Reduction Steps
- Construct a graph G where the nodes of G are the literals occurring in F (with possible repetitions).
- Add the following edges to G:
- An edge joining every pair of complementary literals.
- An edge joining any two literals that occur in the same clause.
- Call the black-box for Independent Set with input graph G and an integer k, where k is the number of clauses in F.
- Return the result ('yes' or 'no') from the