Author:
Bonato Anthony,Gunderson Karen,Shaw Amy
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference23 articles.
1. Benevides, F.S., Przykucki, M.: On slowly percolating sets of minimal size in bootstrap percolation. Electron. J. Comb. 20, 1–20 (2013)
2. Benevides, F.S., Przykucki, M.: Maximum percolation time in two-dimensional bootstrap percolation. SIAM J. Discret. Math. 29, 224–251 (2015)
3. Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Burning a graph is hard. Discret. Appl. Math. 232, 73–87 (2017)
4. Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Bounds on the burning number. Discret. Appl. Math. 235, 16–22 (2018)
5. Bonato, A., Janssen, J., Roshanbin, E.: Burning a graph as a model of social contagion. Lect. Notes Comput. Sci. 8882, 13–22 (2014)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献