Edit this page Backlinks This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong. ===== Lab 12: NP-hard and NP-complete problems ===== Consider the following problems: **k-Independent Set** Let $math[G=(V,E)] be an undirected graph and $math[k] be a natural number. **k-Independent-Set** asks if there exists a subset $math[C\subseteq V] of size $math[k] of nodes from $math[G] such that all nodes from $math[G] are **independent**: $math[\forall u,v \in V . (u,v)\not\in E]. **Subset Sum** **Partition**