Independent Sets in Classes Related to Chair/Fork-free Graphs

T. Karthick

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. MWIS is known to be $NP$-co…