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

DOI10.1007/978-3-319-68705-6_3zbMath1483.05170MaRDI 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

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)