On critical node problems with vulnerable vertices

DOI10.1007/978-3-031-06678-8_36MaRDI QIDQ2169985zbMATH OpenOpenAlexFDO

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

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

Cited in

(3)

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

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)