We define the problem INDEPENDENT SET as follows. INDEPENDENT SET Input: A graph (mathbf{G}) and an integer
Question:
We define the problem INDEPENDENT SET as follows.
INDEPENDENT SET
Input: A graph \(\mathbf{G}\) and an integer \(k\).
Output: YES if there is a subset \(\mathbf{S}\) of the vertices in \(\mathbf{G}\) of size \(k\) or greater such that no edge connects any two vertices in \(\mathbf{S}\), and \(\mathrm{NO}\) otherwise.
Assuming that CLIQUE is \(\mathcal{N} \mathcal{P}\)-complete, prove that INDEPENDENT SET is \(\mathcal{N} \mathcal{P}\)-complete.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Practical Introduction To Data Structures And Algorithm Analysis Java Edition
ISBN: 9780136609117
1st Edition
Authors: Clifford A. Shaffer
Question Posted: