Login / Signup

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.

Liana KhazaliyaPhilipp KindermannGiuseppe LiottaFabrizio MontecchianiKirill Simonov
Published in: ISAAC (2023)
Keyphrases
  • fixed parameter tractable
  • parameterized complexity
  • computational problems
  • np hard
  • np complete
  • vertex set
  • global constraints
  • conjunctive queries
  • relational databases
  • weighted graph