Approximate shortest path algorithms for hierarchical network | |
Tan, GZ; Han, XJ | |
2003 | |
会议名称 | 7th World Multiconference on Systemics, Cybernetics and Informatics |
会议地点 | ORLANDO, FL |
关键词 | approximate shortest path algorithm hierarchical network route optimization large-scale network shortest-path problem |
页码 | 304-309 |
会议录 | 7th World Multiconference on Systemics, Cybernetics and Informatics |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/6206105 |
专题 | 大连理工大学 |
作者单位 | Dalian Univ Technol, Dept Comp Sci & Engn, Dalian 116024, Liaoning, Peoples R China. |
推荐引用方式 GB/T 7714 | Tan, GZ,Han, XJ. Approximate shortest path algorithms for hierarchical network[C]. 见:7th World Multiconference on Systemics, Cybernetics and Informatics. ORLANDO, FL. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论