Exploració per autor "Santoro, Nicola"

Ara es mostren els items 1-3 de 3

    • Connected and internal graph searching 

      Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
      Report de recerca
      Accés obert
      This paper is concerned with the graph searching game. The search number es(G) of a graph G is the smallest number of searchers required to clear G. A search strategy is monotone (m) if no recontamination ever occurs. It ...

    • Connected graph searching 

      Barrière Figueroa, Eulalia; Flocchini, Paola; Fomin, Fedor V.; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2010-09-26)
      Report de recerca
      Accés obert
      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 ...

    • Contiguous and internal graph searching 

      Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos, Dimitrios M. (2002)
      Report de recerca
      Accés obert
      In the graph searching problem, we are given a graph whose edges are all "contaminated", and, via a sequence of "steps" using "searchers", we want to obtain a state of the graph in which all edges are simultaneously "clear". ...