Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Deleting edges to restrict the size of an epidemic in temporal networks   Spreading processes on graphs are a natural model for a wide variety of
real-world phenomena, including information spread over social networks and
biological diseases spreading over contact networks. Often, the networks over
which these processes spread are dynamic in nature, and can be modeled with
temporal graphs. Here, we study the problem of deleting edges from a given
temporal graph in order to reduce the number of vertices (temporally) reachable
from a given starting point. This could be used to control the spread of a
disease, rumour, etc. in a temporal graph. In particular, our aim is to find a
temporal subgraph in which a process starting at any single vertex can be
transferred to only a limited number of other vertices using a
temporally-feasible path. We introduce a natural edge-deletion problem for
temporal graphs and provide positive and negative results on its computational
complexity and approximability.

3
The categories of this paper are: physics
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
22
The categories of this paper are: chao-dyn
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg