Motivated by applications in network epidemiology, we consider the problem of determining whether it is possible to delete at most k edges from a given input graph (of small treewidth) so that the maximum component size in the resulting graph is at most h. While this problem is NP-complete in general, we provide evidence that many of the real-world networks of interest are likely to have small treewidth, and we describe an algorithm which solves the problem in time O((wh)2wn) on an input graph having n vertices and whose treewidth is bounded by a fixed constant w.
CITATION STYLE
Enright, J., & Meeks, K. (2015). Deleting edges to restrict the size of an epidemic: A new application for treewidth. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9486, pp. 574–585). Springer Verlag. https://doi.org/10.1007/978-3-319-26626-8_42
Mendeley helps you to discover research relevant for your work.