Exploració per tema "Minimal Contention-free Matrices"
Ara es mostren els items 1-1 de 1
-
Minimal contention-free matrices with application to multicasting
(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 ...