Research Article
Comparative Study for Trends of Solving Single Source Shortest Path Problems
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 138 - Issue 5 |
| Published: March 2016 |
| Authors: Nilanshi Nigam, Vivek Bhushan Tiwari, Abdul Muttalib Khan |
10.5120/ijca2016908832
|
Nilanshi Nigam, Vivek Bhushan Tiwari, Abdul Muttalib Khan . Comparative Study for Trends of Solving Single Source Shortest Path Problems. International Journal of Computer Applications. 138, 5 (March 2016), 31-35. DOI=10.5120/ijca2016908832
@article{ 10.5120/ijca2016908832,
author = { Nilanshi Nigam,Vivek Bhushan Tiwari,Abdul Muttalib Khan },
title = { Comparative Study for Trends of Solving Single Source Shortest Path Problems },
journal = { International Journal of Computer Applications },
year = { 2016 },
volume = { 138 },
number = { 5 },
pages = { 31-35 },
doi = { 10.5120/ijca2016908832 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2016
%A Nilanshi Nigam
%A Vivek Bhushan Tiwari
%A Abdul Muttalib Khan
%T Comparative Study for Trends of Solving Single Source Shortest Path Problems%T
%J International Journal of Computer Applications
%V 138
%N 5
%P 31-35
%R 10.5120/ijca2016908832
%I Foundation of Computer Science (FCS), NY, USA
Abstract
As the name suggests, Single source shortest path is a technique to find the shortest path corresponding to a source vertex. Single source can be implemented using greedy and dynamic approach. There are many approaches proposed for the same. The idea is to minimize the complexity of the algorithm. This paper presents a review of different algorithm proposed for this technique and compares the complexity and efficiency of each approach . It analyzes each algorithm and takes into account the different parameters involved and hence provide an overview of it. It helps us to know various advantages proposed by different algorithm.
References
- A Yang, D. C. Zhang and P.R. China, 'The Replicated Data Algorithm for Solving the Single Source Shortest Path Problem'.
- Pritam Roy, "A New Memetic Algorithm with GA Crossover Technique to solve Single Source Shortest Path (SSSP) problem".
- Suranga Chandima Nanayakkara, Dipti Srinivasan, Lai Wei Lup Xavier German, Elizabeth Taylor and S.H. Ong, "Genetic Algorithm Based Route Planner for Large Urban Street Networks".
- Yusi Wei and Shojiro Tanaka. "An Improved Thorup Shortest Paths Algorithm with a Modified Component Tree".
- Zhishuai Sun, Zheng Xie, Li Dai and Zhi Chen, "An Algorithm for the Shortest Pairs of Arc-Disjoint Paths Problem".
- Helmi Md Rais, Zulaiha Ali Othman, Abdul Razak Hamdan , "Reducing Iteration Using Candidate List".
- Tianrui Li, Luole Qi, Da Ruan, "An Efficient Algorithm for the Single-Source Shortest Path Problem in Graph".
- JinFu Leng and Wen Zeng, "An Improved Shortest Path Algorithm for Computing One-to-one Shortest Paths On Road Networks".
- R. Iris Bahar, Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Massimo Poncino and Fabio Somenzi. "An ADD-Based Algorithm for Shortest Path Back-Tracing of Large Graph".
- Afshin Ghanizadeh, Saman Sinaie, Amir Atapour Abarghouei, and Siti Mariyam Shamsuddin, "A Fuzzy Particle Swarm Optimization Based Algorithm for Solving Shortest Path Problem".
Index Terms
Keywords