Author:
Fraigniaud Pierre,Korman Amos,Lebhar Emmanuelle
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference19 articles.
1. Chin, F., Ting, H.F.: An almost linear time and O(nlog n+e) messages distributed algorithm for minimum-weight spanning trees. In: Proc. 26th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 257–266 (1985)
2. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Labeling schemes for tree representation. In: Proc. 7th International Workshop on Distributed Computing (IWDC), pp. 13–24 (2005)
3. LNCS;R. Cohen,2005
4. Cormen, T.H., Leiserson, T., Rivest, R.L.: Introduction to Algorithms. MIT Press/McGraw-Hill, New York (1990)
5. Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Proc. ACM-SIAM on Discrete Algorithms (SODA), pp. 352–361 (2004)
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献