Login / Signup
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable.
Liana Khazaliya
Philipp Kindermann
Giuseppe Liotta
Fabrizio Montecchiani
Kirill Simonov
Published in:
CoRR (2023)
Keyphrases
</>
combinatorial problems
fixed parameter tractable
global constraints
computational problems
parameterized complexity
phase transition
vertex set
np hard
np complete
weighted graph
database
search algorithm
abstract argumentation