On critical node problems with vulnerable vertices

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

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

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

Cited In (3)

• On critical node problems with vulnerable vertices
• The connected critical node problem
• The minimum vulnerability problem on specific graph classes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169985)