The other is that it's what's called an NP-complete problem, which means that any other NP-complete problem can be transformed so that solving a maximum weight independent set problem will provide ...

These problems, called NP-complete, were independently formulated and shown to exist in the early 1970s by two computer scientists, American Canadian Stephen Cook and Ukrainian American Leonid Levin.