Survey on Mining Shortest Path in Directed and Dynamic Graphs
K Sangeetha, B. Kaleeswari, K Anitha, G. Boopathi · Zenodo (CERN European Organization for Nuclear Research) · 2016
Calculating the shortest path in larger graph is one of the major problems in graph theory. There are some algorithms available for finding the shortest paths in graph. But those algorithms are not efficient for finding the shortest path in larger directed graph. So we are going to propose a new algorithm for finding the shortest path in directed and dynamic graph. The data reduction technique proxies are used for mining the shortest path in graph. The Dijktra's algorithm is used for finding the shortest path in early graph theory. But it is not efficient for larger graphs. So we are going to create a new algorithm by combining the methods of Dijktra's and data reduction techniques. By using this algorithm we are going to find the shortest path in directed and dynamic graphs.