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

Parameterized Complexity of DAG Partitioning.

René van BevernRobert BredereckMorgan ChopinSepp HartungFalk HüffnerAndré NichterleinOndrej Suchý
Published in: CIAC (2013)
Keyphrases
  • random variables
  • parameterized complexity
  • directed acyclic graph
  • fixed parameter tractable
  • global constraints
  • symmetry breaking
  • np hard
  • np complete
  • vertex set
  • bounded treewidth