Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees-Reference-Cited by-同舟云学术

Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees

Published:1998 Issue: Volume: Page:164-175
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Peleg David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055050

Reference17 articles.

1. Baruch Awerbuch, Israel Cidon, and Shay Kutten. Communication-optimal maintenance of dynamic trees. Unpublished manuscript, September 1988.

2. Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg. Greedy packet scheduling. In Proc. 4th Workshop on Distributed Algorithms, pages 169–184, 1990. LNCS Vol. 486, Springer Verlag.

3. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.

4. Robert G. Gallager, Pierre A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Lang. and Syst., 5(1):66–77, January 1983.

5. J. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM J. on Computing, 1998. To appear. Extended abstract appeared in 34th IEEE Symp. on Foundations of Computer Science, pages 659–668, November 1993.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Latency, capacity, and distributed minimum spanning trees;Journal of Computer and System Sciences;2022-06

2. Improved distributed approximation for Steiner tree in the CONGEST model;Journal of Parallel and Distributed Computing;2021-12

3. Input-Dynamic Distributed Algorithms for Communication Networks;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2021-02-18

4. Latency, Capacity, and Distributed Minimum Spanning Tree†;2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS);2020-11

5. A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees;ACM Transactions on Algorithms;2020-01-31