Shortest path queries in planar graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Danny Z. Chen Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
Jinhui Xu Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
Published in:
Cover Image
 
· Proceeding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pages 469-478
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-184-4 doi>10.1145/335305.335359
Shortest path queries in planar graphs Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 15
· Downloads (cumulative): 733
· Citation Count: 9


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