Reachability and distance queries via 2-hop labels

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Edith Cohen AT&T Labs-Research, Florham Park, NJ
Eran Halperin Tel-Aviv University, Tel Aviv 69978, Israel
Haim Kaplan Tel-Aviv University, Tel Aviv 69978, Israel
Uri Zwick Tel-Aviv University, Tel Aviv 69978, Israel
Reachability and distance queries via 2-hop labels 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 90
· Downloads (cumulative): 669
· Citation Count: 51

Published in:
· Proceeding
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 937-946
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2002
table of contents ISBN:0-89871-513-X

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