Minimum Bisection Is Fixed-Parameter Tractable.

Marek Cygan Daniel Lokshtanov Marcin Pilipczuk Michal Pilipczuk Saket Saurabh

Published in: SIAM J. Comput. (2019)

Keyphrases

fixed parameter tractable
parameterized complexity
vertex set
computational problems
np hard
global constraints
np complete
minimum cost
bounded treewidth
abstract argumentation
conjunctive queries
desirable properties