Login / Signup
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.
Bart M. P. Jansen
Liana Khazaliya
Philipp Kindermann
Giuseppe Liotta
Fabrizio Montecchiani
Kirill Simonov
Published in:
GD (2) (2023)
Keyphrases
</>
search space
upper bound
space complexity
bounded treewidth
databases
multi agent
line drawings
real time
information systems
database systems
reinforcement learning
evolutionary algorithm
description logics
boolean functions
tree decompositions
discrete random variables