On Guarding Orthogonal Polygons with Bounded Treewidth.

Therese C. Biedl Saeed Mehrabi

Published in: CCCG (2017)

Keyphrases

bounded treewidth
np complete
highly parallelizable
minimum length
conjunctive queries
decision problems
relational learning
tractable cases
boolean functions
np hard
fixed parameter tractable
query evaluation
databases
constraint satisfaction
query language
computational complexity
data mining