Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Maximum vertex occupation time and inert fugitive: recontamination does
  help   Given a simple graph $G$, we consider the node search problem with inert
fugitive. We are interested in minimizing the maximum vertex occupation time,
i.e. the maximum number of steps in which a vertex is occupied by a searcher
during a search of $G$. We prove that a search program which does not allow a
recontamination may not find an optimal solution to this problem, and the
difference between the maximum vertex occupation time computed by a monotone
search program and a program without such restriction may be arbitrarily large.

26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
31
The categories of this paper are: ao-sci
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
17
The categories of this paper are: q-fin