The Community for Technology Leaders
Green Image
Issue No. 06 - June (2016 vol. 28)
ISSN: 1041-4347
pp: 1435-1448
Michael Simpson , Department of Computer Science, University of Victoria, Victoria, BC, Canada
Venkatesh Srinivasan , Department of Computer Science, University of Victoria, Victoria, BC, Canada
Alex Thomo , Department of Computer Science, University of Victoria, Victoria, BC, Canada
ABSTRACT
In this work, we study the problem of clearing contamination spreading through a large network where we model the problem as a graph searching game. The problem can be summarized as constructing a search strategy that will leave the graph clear of any contamination at the end of the searching process in as few steps as possible. We show that this problem is NP-hard even on directed acyclic graphs and provide an efficient approximation algorithm. We experimentally observe the performance of our approximation algorithm in relation to the lower bound on several large online networks including Slashdot, Epinions, and Twitter.
INDEX TERMS
Search problems, Approximation algorithms, Games, Social network services, Contamination, Limiting, Partitioning algorithms
CITATION

M. Simpson, V. Srinivasan and A. Thomo, "Clearing Contamination in Large Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 28, no. 6, pp. 1435-1448, 2016.
doi:10.1109/TKDE.2016.2525993
175 ms
(Ver 3.3 (11022016))