Exploració per autor "Fraigniaud, Pierre"
Ara es mostren els items 1-5 de 5
-
Connected and internal graph searching
Barrière Figueroa, Eulalia; Fraigniaud, Pierre; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2002-07)
Report de recerca
Accés obertThis 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 obertIn 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 obertIn 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". ... -
Minimal contention-free matrices with application to multicasting
Cohen, Johanne; Fraigniaud, Pierre; Mitjana Riera, Margarida (2000)
Article
Accés obertIn this paper, we show that the multicast problem in trees can be expressed in term of arranging rows and columns of boolean matrices. Given a $p \times q$ matrix $M$ with 0-1 entries, the {\em shadow} of $M$ is ... -
The price of connectedness in expansions
Fomin, Fedor V.; Fraigniaud, Pierre; Thilikos Touloupas, Dimitrios (2004-05)
Report de recerca
Accés obertExpansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion which naturally arises in a number of applications. Our main tool for this investigation ...