131
Voted
SODA
2010
ACM
16 years 22 days ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...