Những tài liệu gần giống với tài liệu bạn đang xem
Largest minimal percolating sets in hypercubes under 2 bootstrap percolation
Consider the following process, known as r-bootstrap percolation, on a graph G. Designate some initial infected set A and infect any vertex with at least r infected neighbors, continuing until no new vertices can be infected. We say A percolates if
pdf Đăng bởi
ben_hp10
