Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth

Enright, J. and Meeks, K. (2015) Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. In: 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA'15), Houston,TX, USA, 18-20 Dec 2015, pp. 574-585. ISBN 9783319266268 (doi: 10.1007/978-3-319-26626-8_42)

110333.pdf - Accepted Version



Motivated by applications in network epidemiology, we con- sider 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 in- put graph having n vertices and whose treewidth is bounded by a fixed constant w.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Meeks, Dr Kitty and Enright, Dr Jessica
Authors: Enright, J., and Meeks, K.
College/School:College of Science and Engineering > School of Mathematics and Statistics > Mathematics
College of Medical Veterinary and Life Sciences > School of Biodiversity, One Health & Veterinary Medicine
Copyright Holders:Copyright © 2015 Springer International Publishing Switzerland
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record