Immunization in the threshold model: a parameterized complexity study
From MaRDI portal
Cites work
- A fast and effective heuristic for discovering small target sets in social networks
- A first course in network science
- Active influence spreading in social networks
- Algorithmic meta-theorems for restrictions of treewidth
- Algorithms – ESA 2005
- Complexity of conflict-free colorings of graphs
- Discovering small target sets in social networks: a fast and effective algorithm
- Evangelism in social networks
- Evangelism in social networks: algorithms and complexity
- Finding dense subgraphs of sparse graphs
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Integer programming in parameterized complexity: three miniatures
- Iterated Type Partitions
- Modular-width: an auxiliary parameter for parameterized parallel complexity
- On cutting a few vertices from a graph
- On the maximum weight minimal separator
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph
- Parameterized algorithms
- Parameterized complexity of immunization in the threshold model
- Preventing unraveling in social networks: the anchored \(k\)-core problem
- Target set selection for conservative populations
- Target set selection in dense graph classes
- The Firefighter problem: a survey of results, directions and questions
- Treewidth governs the complexity of target set selection
- Treewidth. Computations and approximations
- Vaccinate your trees!
This page was built for publication: Immunization in the threshold model: a parameterized complexity study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069928)
