Login / Signup

Fixed-parameter tractability of multicut parameterized by the size of the cutset.

Dániel MarxIgor Razgon
Published in: STOC (2011)
Keyphrases
  • fixed parameter tractable
  • computational complexity
  • np hard
  • graphical models
  • bayesian networks
  • constraint programming
  • incomplete information
  • combinatorial problems
  • computational problems