Parameterized complexity of immunization in the threshold model
From MaRDI portal
Publication:2154106
DOI10.1007/978-3-030-96731-4_23OpenAlexW3127036875MaRDI QIDQ2154106FDOQ2154106
Authors: Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno 
Publication date: 13 July 2022
Full work available at URL: https://arxiv.org/abs/2102.03537
Cites Work
- Fundamentals of parameterized complexity
- Title not available (Why is that?)
- Algorithmic meta-theorems for restrictions of treewidth
- Treewidth governs the complexity of target set selection
- Parameterized algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph minors. II. Algorithmic aspects of tree-width
- Treewidth. Computations and approximations
- The Firefighter problem: a survey of results, directions and questions
- On cutting a few vertices from a graph
- Complexity of conflict-free colorings of graphs
- Algorithms – ESA 2005
- A first course in network science
- Active influence spreading in social networks
- Finding dense subgraphs of sparse graphs
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph
- A fast and effective heuristic for discovering small target sets in social networks
- Evangelism in social networks: algorithms and complexity
- On the maximum weight minimal separator
- Target set selection for conservative populations
- Integer programming in parameterized complexity: three miniatures
- Vaccinate your trees!
Cited In (3)
This page was built for publication: Parameterized complexity of immunization in the threshold model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154106)
