Chapter 4.12
Packing Problem

1. Independence Set: Given undirected graph, G = (V,E). There exists a subset A ⊆ V , such that A is an independence set, if and only if, no two vertices in A are joined by an edge.
2. Set Packing