Partitioning graphs to speedup Dijkstra's algorithm

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Rolf H. Möhring Technische Universität Berlin, Berlin, Germany
Heiko Schilling Technische Universität Berlin, Berlin, Germany
Birk Schütz Universität Karlsruhe (TH), Karlsruhe, Germany
Dorothea Wagner Universität Karlsruhe (TH), Karlsruhe, Germany
Thomas Willhalm Universität Karlsruhe (TH), Karlsruhe, Germany
Partitioning graphs to speedup Dijkstra's algorithm Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 37
· Downloads (12 Months): 263
· Downloads (cumulative): 2,023
· Citation Count: 16

Published in:
· Journal
Journal of Experimental Algorithmics (JEA) JEA Homepage archive
Volume 11, 2006
Article No. 2.8
ACM New York, NY, USA
table of contents doi>10.1145/1187436.1216585

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