• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability.

Didem GözüpekSibel ÖzkanChristophe PaulIgnasi SauMordechai 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