scientific article; zbMATH DE number 6302977

MaRDI QIDQ5419955zbMATH OpenFDO

Authors

Publication date 11 June 2014

zbMATH Keywords

2-neighbourhood bootstrap percolation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graph theory (including graph drawing) in computer science (68R10) Percolation (82B43)

Recommendations

• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• The maximum time of 2-neighbor bootstrap percolation: complexity results
• The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• On the maximum running time in graph bootstrap percolation
• The time of bootstrap percolation in two dimensions
• The time of graph bootstrap percolation
• The complexity of the bootstraping percolation and other problems

Cited in

(8)

• The maximum time of 2-neighbor bootstrap percolation: complexity results
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
• The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• Complexity of determining the maximum infection time in the geodetic convexity
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Inapproximability results related to monophonic convexity
• Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419955)