메뉴 건너뛰기




Volumn 6, Issue 12, 2007, Pages 4193-4198

Maximum flow and network capacity of network coding for ad-hoc networks

Author keywords

Extreme order statistics; Max flow mincut; Network capacity; Network coding; Random graph

Indexed keywords

EXTREME ORDER STATISTICS; MAX-FLOW MINCUT; NETWORK CAPACITY; NETWORK CODING; RANDOM GRAPH;

EID: 37049007400     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2007.05499     Document Type: Article
Times cited : (19)

References (12)
  • 2
    • 11944253901 scopus 로고    scopus 로고
    • 2nd ed. Cambridge University Press
    • B. Bollobas, Random Graphs, 2nd ed. Cambridge University Press, 2001.
    • (2001) Random Graphs
    • Bollobas, B.1
  • 5
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Oct
    • R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Médard, M.2
  • 8
    • 23844511621 scopus 로고    scopus 로고
    • On the capacity of network coding for random, networks
    • Aug
    • A. Ramamoorthy, J. Shi, and R. Wesel, "On the capacity of network coding for random, networks," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2878-2885, Aug 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.8 , pp. 2878-2885
    • Ramamoorthy, A.1    Shi, J.2    Wesel, R.3
  • 9
    • 0032677628 scopus 로고    scopus 로고
    • Random sampling in cut, flow, and network design problems
    • May
    • D. R. Karger, "Random sampling in cut, flow, and network design problems," Mathematics of Operations Research, vol. 24, no. 2, pp. 383-413, May 1999.
    • (1999) Mathematics of Operations Research , vol.24 , Issue.2 , pp. 383-413
    • Karger, D.R.1


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