Compact oracles for reachability and approximate distances in planar digraphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Mikkel Thorup AT&T Labs---Research, Florham Park, New Jersey
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 51 Issue 6, November 2004
Pages 993-1024
ACM New York, NY, USA
table of contents doi>10.1145/1039488.1039493
Compact oracles for reachability and approximate distances in planar digraphs Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 17
· Downloads (12 Months): 117
· Downloads (cumulative): 1,218
· Citation Count: 52


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