• Minimal contention-free matrices with application to multicasting 

    Cohen, Johanne; Fraigniaud, Pierre; Mitjana Riera, Margarida (2000)
    Accés obert
    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 ...
  • The price of connectedness in expansions 

    Fomin, Fedor V.; Fraigniaud, Pierre; Thilikos Touloupas, Dimitrios (2004-05)
    Report de recerca
    Accés obert
    Expansion 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 ...