|
Volumn , Issue , 2006, Pages 211-
|
On the coding advantage of multiple unicast sessions in undirected graphs
|
Author keywords
[No Author keywords available]
|
Indexed keywords
BIPARTITE NETWORKS;
ENTROPY CALCULUS;
MULTIPLE UNICAST SESSIONS;
NETWORK CODING;
ENCODING (SYMBOLS);
GRAPH THEORY;
INFORMATION THEORY;
TELECOMMUNICATION NETWORKS;
BROADCASTING;
|
EID: 33751032939
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (10)
|
References (0)
|