Title :
A research of calculating the shortest distance in euclidean network
Author :
Yang, Jun ; Fu, Yingxun ; Jiang, Liu ; Song, Junde
Author_Institution :
Lab. of Comput. Network, Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
In this paper, we have designed DOTP (distance of two points) algorithm and some data structure to calculate the shortest distance between the two vertices in Euclidean network. We created a function which had a linear relation with vertices n and edges e in time complexity. This algorithm´s time complexity majority related with non-tree edges t which defined in chapter 2 and has a small magnitude because this algorithm has a linear relation with t2.
Keywords :
computational complexity; query processing; tree data structures; DOTP algorithm; Euclidean network; data structure; nontree edges; shortest distance calculation; time complexity; two points distance; Algorithm design and analysis; Computer networks; Costs; Data structures; Encoding; Intelligent networks; Laboratories; Rail transportation; Tree graphs; XML; DOTP; Euclidean network; shortest distance;
Conference_Titel :
Network Infrastructure and Digital Content, 2009. IC-NIDC 2009. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-4898-2
Electronic_ISBN :
978-1-4244-4900-6
DOI :
10.1109/ICNIDC.2009.5360837
