中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Fast and efficient parallel breadth-first search with power-law graph transformation

文献类型:期刊论文

作者Jiang, Zite1,2; Liu, Tao2; Zhang, Shuai1,2; Yuan, Mengting3; You, Haihang2
刊名FRONTIERS OF COMPUTER SCIENCE
出版日期2022-10-01
卷号16期号:5页码:3
ISSN号2095-2228
DOI10.1007/s11704-021-1004-6
资助项目Natural Science Foundation of China[41930110] ; Natural Science Foundation of China[61872272] ; Natural Science Foundation of China[61640221]
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000740246400004
出版者HIGHER EDUCATION PRESS
源URL[http://119.78.100.204/handle/2XEOYT63/18572]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Yuan, Mengting; You, Haihang
作者单位1.Univ Chinese Acad Sci, Sch Comp Sci & Technol, Beijing 100049, Peoples R China
2.Chinese Acad Sci, Inst Comp Technol, State Key Lab Comp Architecture, Beijing 100190, Peoples R China
3.Wuhan Univ, Sch Comptuer Sci, Wuhan 430072, Peoples R China
推荐引用方式
GB/T 7714
Jiang, Zite,Liu, Tao,Zhang, Shuai,et al. Fast and efficient parallel breadth-first search with power-law graph transformation[J]. FRONTIERS OF COMPUTER SCIENCE,2022,16(5):3.
APA Jiang, Zite,Liu, Tao,Zhang, Shuai,Yuan, Mengting,&You, Haihang.(2022).Fast and efficient parallel breadth-first search with power-law graph transformation.FRONTIERS OF COMPUTER SCIENCE,16(5),3.
MLA Jiang, Zite,et al."Fast and efficient parallel breadth-first search with power-law graph transformation".FRONTIERS OF COMPUTER SCIENCE 16.5(2022):3.

入库方式: OAI收割

来源:计算技术研究所

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

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