ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Shortest paths algorithms: theory and experimental evaluation

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Boris V. Cherkassky Central Institute for Economics and Mathematics, Krasikova, St. 32, 117418, Moscow, Russia
Andrew V. Goldberg Computer Science Department, Stanford University, Stanford, CA
Tomasz Radzik Computer Science Department, King's College, London, WC2R ZLS, United Kingdom
Published in:
· Proceeding
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1994
table of contents ISBN:0-89871-329-3
Shortest paths algorithms: theory and experimental evaluation 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 58
· Citation Count: 14


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 © 2012 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