SIGN IN
SIGN UP
Scaling algorithms for the shortest paths problem
Full Text:
Pdf
Buy this Article
Author:
Andrew V. Goldberg
Computer Science Department, Stanford University, Stanford, CA
Published in:
· Proceeding
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1993
table of contents
ISBN:0-89871-313-7
1993 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 37
· Citation Count: 9
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
design
graph algorithms
path and circuit problems
theory
verification
Feedback
|
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
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder