AnO(N logN) minimal spanning tree algorithm forN points in the plane-Reference-Cited by-同舟云学术

AnO(N logN) minimal spanning tree algorithm forN points in the plane

Published:1986-03 Issue:1 Volume:26 Page:7-16
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Chang R. C.,Lee R. C. T.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

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

Reference15 articles.

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, Mass. (1974).

2. J. L. Bentley,A parallel algorithm for constructing minimum spanning trees, Journal of Algorithms, Vol. 1, No. 1 (1980), 51–59.

3. J. L. Bentley and J. H. Friedman,Fast algorithms for constructing minimal spanning trees in coordinate spaces, IEEE Transactions on Computers, Vol. C-27, No. 2 (1978), 97–105.

4. J. L. Bentley and H. T. Kung,A tree machine for searching problems, Proceedings, IEEE 1979 International Conference on Parallel Processing (1979), pp. 257–266.

5. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest and R. E. Tarjan,Time bound for selection, Journal of Computer and System Sciences, Vol. 7, No. 4 (1972), pp. 724–742.

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

1. Kinetic Euclidean minimum spanning tree in the plane;Journal of Discrete Algorithms;2012-10

2. Kinetic Euclidean Minimum Spanning Tree in the Plane;Lecture Notes in Computer Science;2011

3. A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints;IEEE Transactions on Automation Science and Engineering;2007-01

4. Spanning Trees;Graph Theory for Programmers;2000

5. On the complexity of two circle connecting problems;Discrete Applied Mathematics;1993-11