Login / Signup
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:
WG (2016)
Keyphrases
</>
parameterized complexity
bounded treewidth
fixed parameter tractable
np complete
np hard
conjunctive queries
decision problems
global constraints
computational problems
vertex set
graph theoretic
graph structure