ISSN 1944-9488
Vol. 9, Issue 4, 2013October 01, 2013 EDT
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments
Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments
Articles in Vol. 9, Issue 4, 2013
Vol. 9, Issue 4, 2013
- The Distribution of Second Degrees in the Buckley–Osthus Random Graph ModelAndrey KupavskiiLiudmila OstroumovaDmitriy ShabanovPrasad Tetali
- Stackelberg Strategies for Network Design GamesAngelo FanelliMichele FlamminiLuca Moscardelli
- Concentration and Stability of Community-Detecting Functions on Random NetworksWeituo ZhangChjan C. Lim
- On Approximate Nash Equilibria in Network DesignSusanne AlbersPascal Lenzner
- Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and ExperimentsGuanhua YanMichael MolloyMilan Bradonjić
- On the Hyperbolicity of Small-World and Treelike Random GraphsMichael W. MahoneyWei ChenGuangda HuWenjie Fang
- Editorial Board EOVInternet Mathematics
Yan, Guanhua, Michael Molloy, and Milan Bradonjić. 2013. “Containing Viral Spread on Sparse Random Graphs: Bounds, Algorithms, and Experiments.” Internet Mathematics 9 (4). https://doi.org/10.1080/15427951.2013.798600.