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:
Theor. Comput. Sci. (2017)
Keyphrases
</>
parameterized complexity
bounded treewidth
fixed parameter tractable
np complete
computational problems
global constraints
vertex set
np hard
graph theory
graph structure
graph theoretic
directed graph
boolean functions
conjunctive queries
weighted graph
multiple agents
decision problems