Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Authors:
- 1 September 2006
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 72 (6) , 1077-1093
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Why information security is hard - an economic perspective2005
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems2005
- Code red worm propagation modeling and analysis2002
- Epidemics and immunization in scale‐free networks2002
- The economics of information security investmentACM Transactions on Information and System Security, 2002
- A Polylogarithmic Approximation of the Minimum BisectionSIAM Journal on Computing, 2002
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- Worst-Case Equilibria1999
- Fast Approximate Graph Partitioning AlgorithmsSIAM Journal on Computing, 1999
- Measuring and modeling computer virus prevalence1993