Minimum bisection is fixed parameter tractable.

Marek Cygan Daniel Lokshtanov Marcin Pilipczuk Michal Pilipczuk Saket Saurabh

Published in: STOC (2014)

Keyphrases

fixed parameter tractable
parameterized complexity
vertex set
computational problems
np hard
np complete
global constraints
knowledge base
special case
bounded treewidth
shortest path
optimal policy
constraint programming
minimum cost