Login / Signup
Constructing minimum changeover cost arborescenses in bounded treewidth graphs.
Didem Gözüpek
Hadas Shachnai
Mordechai Shalom
Shmuel Zaks
Published in:
Theor. Comput. Sci. (2016)
Keyphrases
</>
bounded treewidth
np complete
minimum cost
conjunctive queries
decision problems
highly parallelizable
boolean functions
spanning tree
relational learning
data mining
fixed parameter tractable
bounded degree
data model
scheduling problem
monadic datalog