Immunization in the threshold model: a parameterized complexity study
From MaRDI portal
Publication:6069928
DOI10.1007/s00453-023-01118-yMaRDI QIDQ6069928
Adele A. Rescigno, Luisa Gargano, Gennaro Cordasco
Publication date: 17 November 2023
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Treewidth governs the complexity of target set selection
- Complexity of conflict-free colorings of graphs
- Treewidth. Computations and approximations
- Discovering small target sets in social networks: a fast and effective algorithm
- 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
- Parameterized complexity of immunization in the threshold model
- Target set selection for conservative populations
- Whom to befriend to influence people
- On the maximum weight minimal separator
- Vaccinate your trees!
- Evangelism in Social Networks
- 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
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
- Finding Dense Subgraphs of Sparse Graphs
- Integer Programming in Parameterized Complexity: Three Miniatures.
- Iterated Type Partitions
- A First Course in Network Science
- Algorithms – ESA 2005
- Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem
- Parameterized Algorithms
This page was built for publication: Immunization in the threshold model: a parameterized complexity study
