Now showing items 1-2 of 2

  • Connected graph searching 

    Barrière Figueroa, Eulalia; Flocchini, Paola; Fomin, Fedor V.; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2010-09-26)
    External research report
    Open Access
    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 ...
  • Minimal contention-free matrices with application to multicasting 

    Cohen, Johanne; Fraigniaud, Pierre; Mitjana Riera, Margarida (2000)
    Open Access
    In 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 ...