Pages that link to "Item:Q3453576"
From MaRDI portal
The following pages link to Maximum Percolation Time in Two-Dimensional Bootstrap Percolation (Q3453576):
Displaying 26 items.
- Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
- The time of bootstrap percolation in two dimensions (Q328784) (← links)
- On slowly percolating sets of minimal size in bootstrap percolation (Q396751) (← links)
- Inapproximability results related to monophonic convexity (Q499364) (← links)
- On the maximum running time in graph bootstrap percolation (Q528995) (← links)
- The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) (← links)
- Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box (Q1658747) (← links)
- Neighborhood growth dynamics on the Hamming plane (Q1676791) (← links)
- The maximum time of 2-neighbor bootstrap percolation: complexity results (Q1686067) (← links)
- The P3 infection time is W[1]-hard parameterized by the treewidth (Q1705656) (← links)
- Minimum degree conditions for small percolating sets in bootstrap percolation (Q2185227) (← links)
- Smallest percolating sets in bootstrap percolation on grids (Q2213811) (← links)
- Burning the plane. Densities of the infinite Cartesian grid (Q2227973) (← links)
- On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects (Q2346581) (← links)
- Minimal contagious sets in random regular graphs (Q2350108) (← links)
- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results (Q2827810) (← links)
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (Q2945205) (← links)
- Line Percolation in Finite Projective Planes (Q4637326) (← links)
- Bootstrap Percolation on Degenerate Graphs (Q4685764) (← links)
- Computational Complexity of Biased Diffusion-Limited Aggregation (Q5071091) (← links)
- Maximal Spanning Time for Neighborhood Growth on the Hamming Plane (Q5232138) (← links)
- Long running times for hypergraph bootstrap percolation (Q6057454) (← links)
- Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three (Q6077983) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
