期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2010
卷号：2
期号：6
页码：2212-2222
出版社：Engg Journals Publications
摘要：The Dijkstra�s algorithm [1] , which is applied in many real world problems like mobile routing, road maps, railway networks, etc,. is used to find the shortest path between source and destination. There are many techniques available to speedup the algorithm while guaranteeing the optimality of the solution. The main focus of the work is to implement landmark technique and Containers separately and compare the results with random graphs and planar graphs. The combined speedup technique which is based on landmarks and containers were also experimented with random graphs and planar graphs to improve the speedup of the shortest path queries.
关键词：Dijkstra�s Algorithm; Graph Theory; Land mark technique; Geometric Containers ; speed-up
