Login / Signup

Parameterized Complexity of Eulerian Deletion Problems.

Marek CyganDániel MarxMarcin PilipczukMichal PilipczukIldikó Schlotter
Published in: Algorithmica (2014)
Keyphrases
  • parameterized complexity
  • np complete
  • optimization problems
  • fixed parameter tractable
  • computational complexity
  • np hard
  • global constraints