Independent set of a given size
programming
Statement
Independent set of a given size
Given a undirected graph $G = (V,E)$ and positive integer $g > 0$. Does $G$ have an independent set of size $g$?
Solutions
- First solution
- run time
Given a undirected graph $G = (V,E)$ and positive integer $g > 0$. Does $G$ have an independent set of size $g$?