A data structure for dynamically maintaining rooted trees

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Greg N. Frederickson Department of Computer Science, Purdue University, West Lafayette, IN
Published in:
· Proceeding
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Pages 175-184
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1993
table of contents ISBN:0-89871-313-7
A data structure for dynamically maintaining rooted trees 1993 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 16
· Downloads (cumulative): 483
· Citation Count: 14


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