Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard

DOI10.1007/978-3-319-68705-6_3zbMath1483.05170OpenAlexW2766259723MaRDI QIDQ1687900

Daniel Lokshtanov, Amer E. Mouawad, Akanksha Agrawal

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-68705-6_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On critical node problems with vulnerable vertices

This page was built for publication: Critical node cut parameterized by treewidth and solution size is \(W[1]\)-hard