The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (Q2945205)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results |
scientific article; zbMATH DE number 6479945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results |
scientific article; zbMATH DE number 6479945 |
Statements
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (English)
0 references
9 September 2015
0 references
2-neighbour bootstrap percolation
0 references
\(P_3\)-convexity
0 references
maximum time
0 references
infection on graphs
0 references
0 references
0.9985114
0 references
0.98179096
0 references
0.95390314
0 references
0.94796896
0 references
0.9378431
0 references
0.92630947
0 references
0.9223288
0 references
0.9180106
0 references
0.9140072
0 references
