Loading...
Loading...

Go to the content (press return)

Connected graph searching

Author
Barriere, E.; Flocchini, P.; Fomin, F.; Fraigniaud, P.; Nisse, N.; Santoro, N.; Thilikos, D.
Type of activity
Report
Date
2010-09-26
Repository
http://hdl.handle.net/2117/9116 Open in new window
Abstract
In graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher along an edge. The fugitive tries to avoid capture by moving along unguarded paths. The search number of a graph is the minimum number of searchers required to guarantee the capture of the fugitive. In this paper, we initiate the study of this game under the natural restriction o...
Keywords
Cops-and-robbers, Graph searching, Network security
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

  • Barriere Figueroa, Eulalia  (author)
  • Flocchini, Paola  (author)
  • Fomin, Fedor V.  (author)
  • Fraigniaud, Pierre  (author)
  • Nisse, Nicolas  (author)
  • Santoro, Nicola  (author)
  • Thilikos, Dimitrios  (author)

Attachments