124 search results - page 2 / 25 » The spread of the unicyclic graphs |
AAAI
2012
11 years 7 months ago
2012
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
ALGORITHMICA
2011
13 years 1 days ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
EJC
2006
13 years 5 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
ICALP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...