Clearing Contamination in Large Networks
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 proces...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/5636 |