中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
An effective algorithm for hierarchical network topology connectivity check

文献类型:会议论文

作者Wang Shaohua ; Zhong Ershun ; Ma Haibo ; Li Kai ; Zhang Xiaohu ; Zheng Huaihai
出版日期2010
会议名称2nd International Conference on Information Science and Engineering, ICISE2010 - Proceedings
会议日期December 4, 2010 - December 6, 2010
会议地点Hangzhou, China
关键词Algorithms Electric network topology Information science Road network Time complexity Topological networks Motor transportation Connectivity Effective algorithms Excellent performance Heuristic search Hierarchical network Large graphs Path-planning
通讯作者Wang Shaohua
英文摘要Hierarchical network data connectivity check plays an important role in preparation of building network, preprocessing of topological network and path planning. We develop an effective method for hierarchical network topology connectivity checking. The algorithm works on large graphs with time complexity near O(n). Beijing's hierarchical road network is built and topology of that is checked at the same time. The results show excellent performance and correctness.
收录类别EI
会议主办者Hangzhou Dianzi University; United Nations Educational Scientific and Cultural Organization; Nanjing University of Information Science and Technology; Georgia State University; Anhui University of Science and Technology; College of Computer and Information of Hohai University
会议录2nd International Conference on Information Science and Engineering, ICISE2010 - Proceedings
会议录出版者IEEE Computer Society
会议录出版地445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States
ISBN号9781424480968
源URL[http://ir.igsnrr.ac.cn/handle/311030/26323]  
专题地理科学与资源研究所_研究生部
推荐引用方式
GB/T 7714
Wang Shaohua,Zhong Ershun,Ma Haibo,et al. An effective algorithm for hierarchical network topology connectivity check[C]. 见:2nd International Conference on Information Science and Engineering, ICISE2010 - Proceedings. Hangzhou, China. December 4, 2010 - December 6, 2010.

入库方式: OAI收割

来源:地理科学与资源研究所

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

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