ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
Full text PdfPdf (329 KB)
Source Journal of the ACM (JACM) archive
Volume 26 ,  Issue 2  (April 1979) table of contents
Pages: 177 - 182  
Year of Publication: 1979
ISSN:0004-5411
Author
F. K. Hwang  Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 50,   Citation Count: 20
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322123.322124
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
BORUVKA, O On a mmtmal problem Prace Morask~ Pndovedeckd Spolecnostl, Vol 3, 1926
 
3
CHERITON. R, AND TARJAN, R E Finding minimum spanning trees SlAM J Comptng 5 (Dec 1976), 724- 742
 
4
CHOQUET, G Etude de certalns reseaux de routes C R Acad Sct Parts 206 (1938), 310--313
 
5
KRUSKAL, J B On the shortest spanning subtree of a graph. Proc. Amer Math. Soc 7 (Feb 1956), 48-50
 
6
PRIM, R C Shortest connecting networks and some generahzatlons Bell Syst Tech J 36 (Nov 1957), 1389- 1401
 
7
SnAMOS, M. I., AND HOEV, D Closest pomt problems Proc 16th Annual Symp Foundations of Comptr Sct., 1975, pp 151-162 (avadable from IEEE, New York)

CITED BY  20