A Quasi-Polynomial Time Algorithm for the Maximum Weight Independent Set Problem in Graphs Without Long Claws

The Maximum Weight Independent Set (MWIS) problem can be solved in quasi-polynomial time for graphs that exclude any induced subgraph with all connected components being paths or trees with at most three leaves.