Login / Signup

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable.

Sujoy BhoreRobert GanianLiana KhazaliyaFabrizio MontecchianiMartin Nöllenburg
Published in: SoCG (2023)
Keyphrases
  • planar graphs
  • fixed parameter tractable
  • computational problems
  • np hard
  • np complete
  • global constraints
  • minimum weight
  • conjunctive queries
  • graphical models
  • abstract argumentation