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

Parameterized complexity of critical node cuts.

Danny HermelinMoshe KaspiChristian KomusiewiczBarak Navon
Published in: Theor. Comput. Sci. (2016)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • directed graph
  • np hard
  • data management
  • global constraints
  • integrity constraints
  • graph structure