The maximum time of 2-neighbor bootstrap percolation: Complexity results

• Published in: Theoretical computer science Vol. 708; pp. 1 - 17
• Main Authors: Marcilon, Thiago, Sampaio, Rudini
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 17.01.2018
• Subjects: Hull set; P3 convexity; Hull set; P3 convexity

In 2-neighborhood bootstrap percolation on a graph G, given an initially infected set of vertices of G, an infection spreads according to the following deterministic rule: once a vertex of G is infected, it remains infected forever and in consecutive rounds healthy vertices with at least 2 already i...