Login / Signup

Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping.

Christian KomusiewiczMateus de Oliveira OliveiraMeirav Zehavi
Published in: CPM (2017)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • data structure
  • global constraints
  • database systems
  • np complete
  • special case