Title :
An improved algorithm for vertex sequence of shortest path
Author_Institution :
Dept. of Software Eng., Beijing Union Univ., Beijing, China
Abstract :
It´s important to evaluate the shortest paths in many fields. Based on one-dimension arrays an improved algorithm for vertex sequence of shortest path in undirected networks is given. An illumination rule is presented for improving the algorithm efficiency. Both of time and space efficiency can be improved on the rule. Analysis about the algorithm is presented. Experiments have been done for showing the efficiency of the algorithm.
Keywords :
computational complexity; graph theory; illumination rule; one-dimension arrays; shortest path; space efficiency; time efficiency; undirected networks; vertex sequence; Algorithm design and analysis; Computers; Heuristic algorithms; Indexes; Lighting; Partitioning algorithms; Software algorithms; algorithm; shortest path; undirected network; vertex sequence;
Conference_Titel :
Natural Computation (ICNC), 2010 Sixth International Conference on
Conference_Location :
Yantai, Shandong
Print_ISBN :
978-1-4244-5958-2
DOI :
10.1109/ICNC.2010.5583353
