Parameterized complexity of immunization in the threshold model
From MaRDI portal
Publication:2154106
DOI10.1007/978-3-030-96731-4_23OpenAlexW3127036875MaRDI QIDQ2154106
Luisa Gargano, Gennaro Cordasco, Adele A. Rescigno
Publication date: 13 July 2022
Full work available at URL: https://arxiv.org/abs/2102.03537
Related Items (2)
Immunization in the threshold model: a parameterized complexity study ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Treewidth governs the complexity of target set selection
- Complexity of conflict-free colorings of graphs
- Treewidth. Computations and approximations
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- Active influence spreading in social networks
- Algorithmic meta-theorems for restrictions of treewidth
- On cutting a few vertices from a graph
- Target set selection for conservative populations
- On the maximum weight minimal separator
- Vaccinate your trees!
- 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
- Graph minors. II. Algorithmic aspects of tree-width
- Evangelism in social networks: Algorithms and complexity
- Finding Dense Subgraphs of Sparse Graphs
- Integer Programming in Parameterized Complexity: Three Miniatures.
- A First Course in Network Science
- Algorithms – ESA 2005
- Parameterized Algorithms
This page was built for publication: Parameterized complexity of immunization in the threshold model
