中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Network-tree model and shortest path algorithm

文献类型:期刊论文

作者Tan, GZ; Han, XJ; Gao, W
刊名COMPUTATIONAL SICENCE - ICCS 2003, PT III, PROCEEDINGS
出版日期2003
卷号2659页码:537-547
关键词nNetwork-tree model shortest path algorithm large-scale network route optimization algorithm
ISSN号0302-9743
英文摘要For the first time, this paper proposes the Network-Tree Model (NTM), route optimization theory and wholly new, high performance algorithm for shortest path calculation in large-scale network. We first decompose the network into a set of sub-networks by adopting the idea of multi-hierarchy partition and anomalistic regional partition, and then construct the NTM and the Expanded NTM. The Network-Tree Shortest Path (NTSP) algorithm presented in this paper narrows the searching space of the route optimization within a few sub-networks, so it greatly reduces the requirements for main memory and improves the computational efficiency compared to traditional algorithms. Experiment results based on grid network show that NTSP algorithm achieves much higher computational performance than Dijkstra algorithm and other hierarchical shortest path algorithms.
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000184831900053
出版者SPRINGER-VERLAG BERLIN
源URL[http://119.78.100.204/handle/2XEOYT63/13610]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Tan, GZ
作者单位1.Dalian Univ Technol, Dept Comp Sci & Engn, Dalian 116024, Peoples R China
2.Chinese Acad Sci, Comp Technol Inst, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Tan, GZ,Han, XJ,Gao, W. Network-tree model and shortest path algorithm[J]. COMPUTATIONAL SICENCE - ICCS 2003, PT III, PROCEEDINGS,2003,2659:537-547.
APA Tan, GZ,Han, XJ,&Gao, W.(2003).Network-tree model and shortest path algorithm.COMPUTATIONAL SICENCE - ICCS 2003, PT III, PROCEEDINGS,2659,537-547.
MLA Tan, GZ,et al."Network-tree model and shortest path algorithm".COMPUTATIONAL SICENCE - ICCS 2003, PT III, PROCEEDINGS 2659(2003):537-547.

入库方式: OAI收割

来源:计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。