C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
Didem Gözüpek
Sibel Özkan
Christophe Paul
Ignasi Sau
Mordechai Shalom
Published in:
CoRR (2016)
Keyphrases
</>
parameterized complexity
bounded treewidth
fixed parameter tractable
np complete
computational problems
global constraints
np hard
conjunctive queries
graph theory
boolean functions
symmetry breaking
database
relational learning