k-Multi-preference query over road networks | |
Lin, Peiguang; Yin, Yilong; Nie, Peiyao | |
刊名 | PERSONAL AND UBIQUITOUS COMPUTING
![]() |
2016 | |
卷号 | 20期号:3页码:413-429 |
关键词 | kMP query Road network Query graph Approximation distance matrix Shortest path |
DOI | 10.1007/s00779-016-0913-0 |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/4701672 |
专题 | 山东大学 |
作者单位 | 1.Shandong Univ Finance & Econ, Sch Comp Sci & Technol, Jinan, Peoples R China. 2.[Lin, Peiguang 3.Yin, Yilong |
推荐引用方式 GB/T 7714 | Lin, Peiguang,Yin, Yilong,Nie, Peiyao. k-Multi-preference query over road networks[J]. PERSONAL AND UBIQUITOUS COMPUTING,2016,20(3):413-429. |
APA | Lin, Peiguang,Yin, Yilong,&Nie, Peiyao.(2016).k-Multi-preference query over road networks.PERSONAL AND UBIQUITOUS COMPUTING,20(3),413-429. |
MLA | Lin, Peiguang,et al."k-Multi-preference query over road networks".PERSONAL AND UBIQUITOUS COMPUTING 20.3(2016):413-429. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论