SIGN IN
SIGN UP
Dynamic trees in practice
Full Text:
PDF
Buy this Article
Authors:
Robert E. Tarjan
Princeton University, Princeton, NJ, USA and HP Labs, Palo Alto, CA, USA
Renato F. Werneck
Microsoft Research Silicon Valley, Mountain View, CA, USA
Published in:
· Journal
Journal of Experimental Algorithmics (JEA)
JEA Homepage
archive
Volume 14, December 2009
Article No. 5
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1498698.1594231
2010 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 17
· Downloads (12 Months): 139
· Downloads (cumulative): 499
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
combinatorial algorithms
dynamic trees
experimental evaluation
experimentation
link-cut trees
network problems
top trees
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder