Optimizing shortest path queries with parallelized arc flags

International Conference on Recent Trends in Information Technology, ICRTIT 2011

Volumn , Issue , 2011, Pages 601-606

  Kalpana, R ^a   Thambidurai, P ^b  

^a PONDICHERRY ENGINEERING COLLEGE   (India)

^b Perunthalaivar Kamarajar Institute of Engineering and Technology   (India)

Author keywords

Arc flags; bidirectional arc flags; Dijkstra's algorithm; parallelized bidirectional arc flags

Indexed keywords

ARC FLAGS; BI-DIRECTIONAL SEARCH; BIDIRECTIONAL ARC FLAGS; DIJKSTRA'S ALGORITHMS; DIJKSTRA'S SHORTEST PATH ALGORITHM; DIRECTED GRAPHS; PARALLELIZED BIDIRECTIONAL ARC FLAGS; PRACTICAL PROBLEMS; PRE-PROCESSING; REAL-WORLD GRAPHS; RUNTIMES; SHORTEST PATH; SHORTEST PATH ALGORITHMS;

ALGORITHMS; INFORMATION TECHNOLOGY;

GRAPH THEORY;

EID: 80052221673     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRTIT.2011.5972476     Document Type: Conference Paper

References (24)

1. DIJKSTRA, E. W, (1959) "A note on two problems in connection with graphs", In Numerische Mathematik, Vol. 1, Mathematisch Centrum, Amsterdam, The Netherlands, pp269-271
2. Frank Schulz, Dorothea Wagner, and Weihe, K. "Dijkstra's algorithm on-line: An empirical case study from public railroad transport", ACM Journal of Experimental Algorithmics 5, 12, 2000.
3. Holzer, M, Schulz. F, Wagner and Willhalm. T. "Combining speed-up techniques for shortest-path computations", ACM Journal of Experimental Algorithmics, Vol.10, Article No.2.5, pp.1-18, 2006.
4. Dorothea Wagner and Thomas Willhalm, "Speed-Up Techniques for Shortest-Path Computations" In Proc. STACS 2007, LNCS, SpringerVerlag, New York. pp43-59, 2007
5. I. Phol, (1971) "Bi-directional Search", In Machine Intelligence, volume 6, pp 124-140. Edinburgh Univ. Press, Edinburgh.
6. th Annual ACM-SIAM Symposium on Discrete Algorithms.
7. Andrew V. Goldberg and Renato F. Wernecky (2005), "Computing Point-to-Point Shortest Paths from External Memory", In Proc. The Seventh Workshop on Algorithm Engineering and Experiments (ALENEX05)
8. Dorothea Wagner and Thomas Willhalm, "Geometric Containers for Efficient Shortest-Path Computation", ACM Journal of Experimental Algorithmics, Vol.10, Article No.1.3, pp.1-30, 2005.
9. Martin Holzer, Frank Schulz and Dorothea Wagner, "Engineering Multilevel Overlay Graphs for Shortest-Path Queries", ACM Journal of Experimental Algorithmics, Vol.13, Article No.2.5, Sep-2008.
10. th Workshop on Algorithm Engineering and Experiments. LNCS 2409, Springer-Verlag, New York. pp43-59.
11. Sanders, P. and Schultes. D "Highway hierarchies hasten exact shortest path queries", In the Proceedings European Symposium on Algorithms, 2005.
12. th European Symposium on Algorithms. LNCS, vol. 4168. Springer, New York. 804-816. 2006.
13. GUTMAN, R.J, "Reach-based routing: A new approach to shortest path algorithms optimized for road networks", In Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004.
14. Schultes. D and Sanders. P, "Dynamic highway-node routing", In Proceedings of the 6thWorkshop on Experimental and Efficient algorithms, LNCS. Springer, New York. 66-79, 2007.
15. FREDERIKSON, G. N, "Fast algorithms for shortest paths in planar graphs with applications", SIAM Journal on Computing 16, 6, 1004-1022, 1987.
16. Mohring, R. H., Schilling, H., Schutz, B., Wagner. D., and Willhalm, T. "Partitioning graphs to speed up Dijkstra's algorithm", ACM Journal of Experimental Algorithmics, Vol.11, Article No.2.8, pp.1-29, 2006.
17. Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, & Dorothea Wagner, (2010) "Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm", ACM Journal of Experimental Algorithmics, Vol. 15, Article No. 3
18. th Workshop on Experimental Algorithms(WEA'08), Springer, Berlin, pp.303-318.
19. Dominik Schultes, Johannes Singler, Peter Sanders, Parallel Highway Node Routing, A Technical Report, Feb, 2008. algo2.iti.kit.edu/schultes/hwy/ parallelHNR.pdf
20. R. Kalpana, P. Thambidurai et al., (2010), "Exploiting Parallelism in Bidirectional Dijkstra for Shortest-Path Computation", in the Proceedings of International conference on Computers, Communication and Intelligence at, Vellammal college of Engg., & Tech., Madurai, India, pp. 351-356, July 2010
21. R. Kalpana, P. Thambidurai, (2010), "Optimization of Landmark preprocessing with Mulitcore Systems,", Journal of Computing, Vol.2, Issue.8, pp.102-108, August 2010.
22. OpenMP, http://www.openmp.org
23. http://www.usenix.org/publications/library/proceedings/als00/2000papers/ papers/full-papers/brownrobert/brownrobert-html/node3.html
24. LEDA, http://www.algorithmic-solutions.com