On critical node problems with vulnerable vertices

DOI10.1007/978-3-031-06678-8_36OpenAlexW4285157100MaRDI QIDQ2169985

Niels Grüttemeier, Frank Sommer, Jannik Schestag, Christian Komusiewicz

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_36

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Fundamentals of parameterized complexity
• Parameterized complexity of critical node cuts
• Complexity of the critical node problem over trees
• Detecting critical nodes in sparse graphs
• Deleting edges to restrict the size of an epidemic: a new application for treewidth
• Critical node cut parameterized by treewidth and solution size is \(W[1\)-hard]
• The critical node detection problem in networks: a survey
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• On the Parameterized Complexity of Cutting a Few Vertices from a Graph
• Parameterized Algorithms

This page was built for publication: On critical node problems with vulnerable vertices