Maximum running times for graph bootstrap percolation processes (Q6949754)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 8073137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum running times for graph bootstrap percolation processes |
scientific article; zbMATH DE number 8073137 |
Statements
Maximum running times for graph bootstrap percolation processes (English)
0 references
1 August 2025
0 references
bootstrap percolation
0 references
weak saturation
0 references
cellular automata
0 references
monotone cellular automata
0 references
extremal combinatorics
0 references
