Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Chazelle, B. A faster deterministic algorithm for minimum spanning trees, Proc. 38th Ann. IEEE Symp. Found. Comp. Sci. (1997), 22–31.
2. Chazelle, B. A deterministic algorithm for minimum spanning trees, manuscript, 1998.
3. Fredman, M.L., Tarjan, R.E. Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (1987), 596–615.
4. Hoffman, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.E. Sorting Jordan sequences in linear time using level-linked search trees, Inform. and Control 68 (1986), 170–184.
5. Matias, Y., Vitter, J.S., Young, N. Approximate Data Structures with Applications, Proc. 5th Ann. SIAM/ACM Symp. Disc. Alg. (SODA’ 94), 1994.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Optimal Minimum Spanning Tree Algorithm;Automata, Languages and Programming;2000