Results 171 to 180 of about 15,698 (212)
Some of the next articles are maybe not open access.
On Graph Burning and Edge Burning.
Graph burning is a deterministic, discrete-time process that models how influence or contagion spreads in a graph. Initially, all vertices are unburned. At each round, one new vertex is chosen to burn. Once a vertex is burned, in the next round each of its unburned neighbors become burned. The process ends when all vertices are burned.Giuseppe F. Italiano +2 more
openaire +2 more sources
Incidence and characteristics of non-accidental burns in children: A systematic review
Burns, 2020Roel Bakx +2 more
exaly
Epidemiology of burns throughout the world. Part I: Distribution and risk factors
Burns, 2011Michael Peck
exaly