Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Punj, Hritik"'
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 of its neighbours to become burning before a new fire source is chosen
Externí odkaz:
http://arxiv.org/abs/2211.15633
Publikováno v:
In Discrete Mathematics January 2025 348(1)
