Graph searching and search time

  • Authors:

  • Franz J. Brandenburg;Stephanie Herrmann

  • Affiliations:

  • Lehrstuhl für Informatik, Universität Passau, Passau, Germany;Lehrstuhl für Informatik, Universität Passau, Passau, Germany

  • Venue:
  • SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Graph searching is the game of capturing a fugitive by a team of searchers in a network. There are equivalent characterizations in terms of path-width, interval thickness, and vertex separation. So far the interest has mainly focused on the search number of a graph, which is the minimal the number of searchers to win the game, and accordingly on the width and the thickness. These parameters measure the needed resources and correspond to space complexity. As its dual, we introduce the search time, which has not yet been studied in graph searching. We prove that all main results on graph searching can be generalized to include search time, such as monotone or recontamination free graph searching, and the characterizations in terms of path-width, interval graphs, and vertex separation, for which we introduce appropriate length parameters. We establish the NP-completeness of both search-width and search-time. Finally we investigate the speed-up by an extra searcher. There are ’good’ classes of graphs where a single extra searcher reduces the search time to one half and ’bad’ ones where some extra searchers are no real help.