Irreversible 2-conversion set in graphs of bounded degree

zbMath1401.05283arXiv1412.4188MaRDI QIDQ4560206

Bernard Lidický, Jan Kynčl, Tomáš Vyskočil

Publication date: 10 December 2018

Full work available at URL: https://arxiv.org/abs/1412.4188

zbMATH Keywords

spread of infectionNP-complete problembootstrap percolationtoroidal gridmatroid parity problemirreversible \(k\)-conversion process

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (7)

Irreversible \(k\)-threshold conversion number of circulant graphs ⋮ Target set selection with maximum activation time ⋮ Irreversible k-threshold conversion number of some graphs ⋮ Target set selection for conservative populations ⋮ Dynamic monopolies for interval graphs with bounded thresholds ⋮ On some tractable and hard instances for partial incentives and target set selection ⋮ On reconfigurability of target sets

This page was built for publication: Irreversible 2-conversion set in graphs of bounded degree