Login / Signup

A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs.

Jayakrishnan MadathilRoohani SharmaMeirav Zehavi
Published in: MFCS (2019)
Keyphrases
  • computational complexity
  • preprocessing
  • np hard
  • expectation maximization
  • data sets
  • special case
  • dynamic programming
  • convex hull
  • convergence rate