Max independent set problem (graph)
programming
Statement
Max independent set problem
Given a undirected graph $G = (V,E)$ what is the size of the largest independent set in $G$?
Solutions
- First solution
- run time
Given a undirected graph $G = (V,E)$ what is the size of the largest independent set in $G$?