Login / Signup

Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping.

Christian KomusiewiczMateus de Oliveira OliveiraMeirav Zehavi
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • data structure
  • np hard
  • global constraints