| A SURVEY ON HOP-CONSTRAINED SHORTEST PATH PROBLEM AND AN IMPROVED ALGORITHM | |
| Fang, Qingan; Han, Jun; Mao, Liyong; Li, Zhaoguo | |
| 2012 | |
| 会议名称 | 2011 3RD INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT (ICCTD 2011), VOL 1 |
| 会议日期 | 2012-01-01 |
| 关键词 | Hop-constrained Shortest Path HSP Bidirectional breadth-first search |
| 页码 | 49-53 |
| 收录类别 | CPCI-S |
| URL标识 | 查看原文 |
| WOS记录号 | WOS:000307481200010 |
| 内容类型 | 会议论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/6574545 |
| 专题 | 北京航空航天大学 |
| 推荐引用方式 GB/T 7714 | Fang, Qingan,Han, Jun,Mao, Liyong,et al. A SURVEY ON HOP-CONSTRAINED SHORTEST PATH PROBLEM AND AN IMPROVED ALGORITHM[C]. 见:2011 3RD INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT (ICCTD 2011), VOL 1. 2012-01-01. |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论