Maximum vertex occupation time and inert fugitive: Recontamination does help

Authors:
Dariusz Dereniowski
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland
Venue:
Information Processing Letters
Year:
2009

Citing 7
Cited 0

Searching and pebbling

Theoretical Computer Science
Monotonicity in graph searching

Journal of Algorithms
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics
Lower bounds on treespan

Information Processing Letters
Monotonicity of non-deterministic graph searching

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

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. Moreover, the difference between the minimum maximum vertex occupation time computed by a monotone search program and a program without such a restriction may be arbitrarily large.