Maximum Percolation Time in Two-Dimensional Bootstrap Percolation

From MaRDI portal
Publication:3453576

DOI10.1137/130941584zbMath1371.60169arXiv1310.4457OpenAlexW2007804480MaRDI QIDQ3453576

Michał Przykucki, Fabrício Siqueira Benevides

Publication date: 27 November 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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




Related Items (27)

The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degreeComplexity of determining the maximum infection time in the geodetic convexityThe time of bootstrap percolation in two dimensionsComputational Complexity of Biased Diffusion-Limited AggregationMaximal bootstrap percolation time on the hypercube via generalised snake-in-the-boxNeighborhood growth dynamics on the Hamming planeThe Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity ResultsMinimum degree conditions for small percolating sets in bootstrap percolationOn slowly percolating sets of minimal size in bootstrap percolationThe maximum time of 2-neighbor bootstrap percolation: complexity resultsLong running times for hypergraph bootstrap percolationExtremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and ThreeOn the running time of hypergraph bootstrap percolationTarget set selection with maximum activation timeThe maximum infection time in the geodesic and monophonic convexitiesThe P3 infection time is W[1-hard parameterized by the treewidth] ⋮ Smallest percolating sets in bootstrap percolation on gridsBurning the plane. Densities of the infinite Cartesian gridLine Percolation in Finite Projective PlanesInapproximability results related to monophonic convexityOn the maximum running time in graph bootstrap percolationOn the parameterized complexity of the geodesic hull numberBootstrap Percolation on Degenerate GraphsThe Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized ResultsMaximal Spanning Time for Neighborhood Growth on the Hamming PlaneThe maximum time of 2-neighbour bootstrap percolation: algorithmic aspectsMinimal contagious sets in random regular graphs






This page was built for publication: Maximum Percolation Time in Two-Dimensional Bootstrap Percolation