Parameterized complexity of critical node cuts.

Danny Hermelin Moshe Kaspi Christian Komusiewicz Barak 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