Sciweavers

CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 4 months ago
Polynomial-time algorithms for coding across multiple unicasts
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
Tracey Ho