메뉴 건너뛰기




Volumn , Issue , 2010, Pages

A simple necessary and sufficient condition for the double unicast problem

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; CAPACITY REGIONS; NETWORK CODING; SUFFICIENT CONDITIONS; TWO SOURCES; UNICAST; UNICAST PROBLEMS; VECTOR NETWORKS;

EID: 77955368312     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2010.5501820     Document Type: Conference Paper
Times cited : (22)

References (9)
  • 6
    • 1842473639 scopus 로고    scopus 로고
    • Complexity classification of network information flow problems
    • A. R. Lehman and E. Lehman. Complexity classification of network information flow problems. SODA, 2004.
    • (2004) SODA
    • Lehman, A.R.1    Lehman, E.2
  • 7
    • 51649105182 scopus 로고    scopus 로고
    • Beyond the Butterfly a Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast Sessions
    • C.-C. Wang and N. B. Shroff. Beyond the Butterfly A Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast Sessions. In Proc. IEEE International Symposium on Information Theory, 2007.
    • Proc. IEEE International Symposium on Information Theory, 2007
    • Wang, C.-C.1    Shroff, N.B.2
  • 8
    • 33745121157 scopus 로고    scopus 로고
    • An outer bound for multisource multisink network coding with minimum cost consideration
    • June
    • X. Yan, J. Yang, and Z. Zhang. An outer bound for multisource multisink network coding with minimum cost consideration. IEEE Trans. Inform. Theory, 52(6):2373-2385, June 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.6 , pp. 2373-2385
    • Yan, X.1    Yang, J.2    Zhang, Z.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.