Login / Signup
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth.
Therese C. Biedl
Saeed Mehrabi
Published in:
Algorithmica (2021)
Keyphrases
</>
bounded treewidth
np complete
highly parallelizable
boolean functions
decision problems
minimum length
conjunctive queries
relational learning
monadic datalog
tractable cases
database
knowledge representation
decision makers
relational data