SIGN IN
SIGN UP
Improved embeddings of graph metrics into random trees
Full Text:
PDF
Get this Article
Authors:
Kedar Dhamdhere
Carnegie Mellon University, Pittsburgh PA
Anupam Gupta
Carnegie Mellon University, Pittsburgh PA
Harald Räcke
Carnegie Mellon University, Pittsburgh PA
Published in:
· Proceeding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pages 61-69
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2006
table of contents
ISBN:0-89871-605-5
2006 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 420
· Citation Count: 4
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
design and analysis of algorithms
graph algorithms
probabilistic computation
theory
trees
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder