On Guarding Orthogonal Polygons with Bounded Treewidth.

Therese C. Biedl Saeed Mehrabi

Published in: CoRR (2017)

Keyphrases

bounded treewidth
np complete
highly parallelizable
conjunctive queries
decision problems
boolean functions
minimum length
relational learning
tractable cases
monadic datalog
database
computational complexity
np hard