Polynomial algorithms for minimum cost paths in periodic graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Franz Höfting Department of Mathematics and Computer Science, University of Paderborn, D-4790 Paderborn, Germany
Egon Wanke Department of Mathematics and Computer Science, University of Paderborn, D-4790 Paderborn, Germany
Published in:
· Proceeding
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Pages 493-499
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1993
table of contents ISBN:0-89871-313-7
Polynomial algorithms for minimum cost paths in periodic graphs 1993 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 19
· Downloads (cumulative): 233
· Citation Count: 1


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