메뉴 건너뛰기




Volumn 35, Issue 1, 2006, Pages 120-131

Minimum-weight spanning tree construction in O(log log n) communication rounds

Author keywords

Distributed algorithms; Minimum weight spanning tree

Indexed keywords

ALGORITHMS; COMMUNICATION; MATHEMATICAL MODELS;

EID: 33644585189     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704441848     Document Type: Article
Times cited : (145)

References (15)
  • 2
    • 0022144867 scopus 로고
    • Complexity of network synchronization
    • B. AWERBUCH, Complexity of network synchronization, J. ACM, 32 (1985), pp. 804-823.
    • (1985) J. ACM , vol.32 , pp. 804-823
    • Awerbuch, B.1
  • 3
    • 0023581508 scopus 로고
    • Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems
    • B. AWERBUCH, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 230-240.
    • (1987) Proceedings of the 19th Annual ACM Symposium on Theory of Computing , pp. 230-240
    • Awerbuch, B.1
  • 4
    • 0000019758 scopus 로고
    • New connectivity and MSF algorithms for the shuffle-exchange network and PRAM
    • B. AWERBUCH AND Y. SHILOACH, New connectivity and MSF algorithms for the shuffle-exchange network and PRAM, IEEE Trans. Comput., 36 (1987), pp. 1258-1263.
    • (1987) IEEE Trans. Comput. , vol.36 , pp. 1258-1263
    • Awerbuch, B.1    Shiloach, Y.2
  • 7
    • 0000601523 scopus 로고    scopus 로고
    • A sublinear time distributed algorithm for minimum-weight spanning trees
    • J. A. GARAY, S. KUTTEN, AND D. PELEG, A sublinear time distributed algorithm for minimum-weight spanning trees, SIAM J. Comput., 27 (1998), pp. 302-316.
    • (1998) SIAM J. Comput. , vol.27 , pp. 302-316
    • Garay, J.A.1    Kutten, S.2    Peleg, D.3
  • 9
    • 0029276335 scopus 로고
    • A randomized linear time algorithm to find minimum spanning trees
    • D. R. KARGER, P. N. KLEIN, AND R. E. TARJAN, A randomized linear time algorithm to find minimum spanning trees, J. ACM, 42 (1995), pp. 321-328.
    • (1995) J. ACM , vol.42 , pp. 321-328
    • Karger, D.R.1    Klein, P.N.2    Tarjan, R.E.3
  • 12
    • 0035188171 scopus 로고    scopus 로고
    • Near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
    • D. PELEG AND V. RUBINOVICH, Near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction, SIAM J. Comput., 30 (2000), pp. 1427-1442.
    • (2000) SIAM J. Comput. , vol.30 , pp. 1427-1442
    • Peleg, D.1    Rubinovich, V.2


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