Modification to Planarity is Fixed Parameter Tractable.

Fedor V. Fomin Petr A. Golovach Dimitrios M. Thilikos

Published in: STACS (2019)

Keyphrases

fixed parameter tractable
parameterized complexity
np hard
computational problems
np complete
global constraints
conjunctive queries
bounded treewidth
abstract argumentation
special case
optimal solution
constraint programming