Algorithms for Searching Paths in Huge Graphs

被引：0
|
作者：
Polyakov I.V. [1 ]
Chepovskiy A.A. [1 ]
Chepovskiy A.M. [1 ]
机构：
[1] National Research University “The Higher School of Economics,”, Moscow
来源：
Journal of Mathematical Sciences | 2015年 / 211卷 / 3期
关键词：
Short Path; Short Path Problem; Adjacency List; Dijkstra Algorithm; Graph Link;
D O I：
10.1007/s10958-015-2612-1
中图分类号：
学科分类号：
摘要：
Various approaches for data storing and processing are investigated in this paper. A new algorithm for finding paths in a huge graph is introduced. © 2015, Springer Science+Business Media New York.
引用
收藏
页码：413 / 417
页数：4
相关论文
共 50 条
12345