Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard.

Akanksha Agrawal Daniel Lokshtanov Amer E. Mouawad

Published in: WG (2017)

Keyphrases

space complexity
search space
upper bound
graph structure
linear equations
bounded treewidth
optimal solution
integer programming
np hard
directed graph
boolean functions
exact solution