An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
- 1 April 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (2), 177-182
- https://doi.org/10.1145/322123.322124
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956