Author:
Bidgoli Mohammadreza,Mohammadian Ali,Tayfeh-Rezaie Behruz
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Balogh, J., Bollobás, B., Morris, R.: Graph bootstrap percolation. Random Struct. Algorithms 41, 413–440 (2012)
2. Bollobás, B.: Weakly $$k$$-saturated graphs, Beiträge zur Graphentheorie (Kolloquium, Manebach, 1967), pp. 25–31. Teubner, Leipzig (1968)
3. Angel, O., Kolesnik, B.: Sharp thresholds for contagious sets in random graphs. Ann. Appl. Probab. 28, 1052–1098 (2018)
4. Bollobás, B., Przykucki, M., Riordan, O., Sahasrabudhe, J.: On the maximum running time in graph bootstrap percolation. Electron. J. Combin. 24, #P2.16 (2017)
5. Gunderson, K., Koch, S., Przykucki, M.: The time of graph bootstrap percolation. Random Struct. Algorithms 51, 143–168 (2017)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weakly saturated random graphs;Random Structures & Algorithms;2024-02-19
2. H-percolation with a random H;Electronic Communications in Probability;2024-01-01
3. On the Running Time of Hypergraph Bootstrap Percolation;The Electronic Journal of Combinatorics;2023-06-16