1 citations · 1 across the 1 of their papers we have counts for
1 paper
Karen Gunderson, William Kellough, JD Nir +1
Graph burning is a discrete-time process that models the spread of influence in a network. Vertices are either burning or unburned, and in each round, a burning vertex causes all o…