Orthogonal planarity testing of bounded treewidth graphs.

Emilio Di Giacomo Giuseppe Liotta Fabrizio Montecchiani

Published in: J. Comput. Syst. Sci. (2022)

Keyphrases

bounded treewidth
np complete
decision problems
conjunctive queries
boolean functions
highly parallelizable
tractable cases
relational learning
machine learning
np hard
graph theoretic
fixed parameter tractable
databases
search space
information extraction
constraint satisfaction problems