Author:
Bar-Ilan Judit,Zernik Dror
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Afek, Y. and Gafni, E., Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks, PODC 1985, pp 199–207.
2. Aho, V. A., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
3. Awerbuch, B., Linear Time Distributed Algorithms for Minimum Spanning Trees, leader election, counting and related problems, 19th STOC, 1987, pp. 230–240.
4. Broder, A. Z., Generating Random Spanning Trees, To appear in 30th FOCS, 1989.
5. Biggs, N., Algebraic Graph Theory
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献