Ara es mostren els items 3-4 de 4

• #### Minimal contention-free matrices with application to multicasting ﻿

(2000)
Article
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 ﻿

(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 ...