Subexponential-time Algorithms for Maximum Independent Set in $P_t$-free and Broom-free Graphs

Gábor Bacsó, Daniel Lokshtanov, Dániel Marx +3

In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on $P_t$-free graphs, that is, on graphs not containing a…