QQ客服 官方微博 反馈留言

	Top-k critical Vertices Query on Shortest Path
	Ma, Jing; Yao, Bin; Gao, Xiaofeng; Shen, Yanyan; Guo, Minyi
	2018
卷号	30期号:10页码:1999-2012
URL标识	查看原文
WOS记录号	WOS:000444603900013
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/6247777
专题	贵州大学
作者单位	1.[1]Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200000, Peoples R China 2.[2]Beihang Univ, State Key Lab Software Dev Environm, Beijing 100083, Peoples R China 3.[3]Guizhou Univ, Guizhou Prov Key Lab Publ Big Data, Guiyang, Guizhou, Peoples R China 4.[4]Renmin Univ China, Beijing Key Lab Big Data Management & Anal Method, Beijing 100872, Peoples R China
推荐引用方式 GB/T 7714	Ma, Jing,Yao, Bin,Gao, Xiaofeng,et al. Top-k critical Vertices Query on Shortest Path[J],2018,30(10):1999-2012.
APA	Ma, Jing,Yao, Bin,Gao, Xiaofeng,Shen, Yanyan,&Guo, Minyi.(2018).Top-k critical Vertices Query on Shortest Path.,30(10),1999-2012.
MLA	Ma, Jing,et al."Top-k critical Vertices Query on Shortest Path".30.10(2018):1999-2012.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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