Pages that link to "Item:Q396751"

The following pages link to On slowly percolating sets of minimal size in bootstrap percolation (Q396751):

Displaying 21 items.

• The time of bootstrap percolation in two dimensions (Q328784) (← links)
• The time of bootstrap percolation with dense initial sets (Q400563) (← 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)
• 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)
• On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← 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)
• 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)
• The time of bootstrap percolation with dense initial sets for all thresholds (Q3192370) (← links)
• Maximal Spanning Time for Neighborhood Growth on the Hamming Plane (Q5232138) (← links)
• Long running times for hypergraph bootstrap percolation (Q6057454) (← links)
• Target set selection with maximum activation time (Q6110610) (← links)