Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization

Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos +1

We study the parameterized complexity of a broad class of problems called "local graph partitioning problems" that includes the classical fixed cardinality problems as max k-vertex…