Abstract

In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on Pt -free graphs, that is, on graphs not containing any induced path on t vertices. So far, polynomial-time algorithms are known only for t≤5 (Lokshtanov et al., in: Proceedings of
... read more