Computing Euclidean maximum spanning trees

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: C. Monma Bell Communications Research, Morristown
M. Paterson University of Warwick, Coventry, England
S. Suri Bell Communications Research, Morristown
F. Yao Xerox PARC, Palo Alto
Computing Euclidean maximum spanning trees Published by ACM 1988 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 38
· Downloads (cumulative): 695
· Citation Count: 2

Published in:
· Proceeding
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Pages 241-251
ACM New York, NY, USA ©1988
table of contents ISBN:0-89791-270-5 doi>10.1145/73393.73418

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder