1 paper
Jannick Borowitz, Ernestine GroÃmann, Mattthias Schimek
Finding maximum-weight independent sets in graphs is an important NP-hard optimization problem. Given a vertex-weighted graph G, the task is to find a subset of pairwise non-adja…