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 条
  • [41] Searching semantically diverse paths
    Xu Teng
    Goce Trajcevski
    Andreas Züfle
    Distributed and Parallel Databases, 2023, 41 : 603 - 638
  • [42] Strategies for searching graphs
    Gal, S
    GRAPH THEORY, COMBINATORICS AND ALGORITHMS: INTERDISCIPLINARY APPLICATIONS, 2005, : 189 - 214
  • [43] ALGORITHMS FOR FINDING NON-CROSSING PATHS WITH MINIMUM TOTAL LENGTH IN PLANE GRAPHS
    TAKAHASHI, JY
    SUZUKI, H
    NISHIZEKI, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 400 - 409
  • [44] Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
    Wang, Haitao
    Xue, Jie
    DISCRETE & COMPUTATIONAL GEOMETRY, 2020, 64 (04) : 1141 - 1166
  • [45] Vectorized algorithms for detecting the shortest paths in weighted directed graphs and their realization in vector supercomputers
    Kovalenko, N.S.
    Ovseets, M.I.
    Yaznevich, M.I.
    Programmirovanie, 1992, (01): : 65 - 71
  • [46] Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
    Rafael F. Santos
    Alessandro Andrioni
    Andre C. Drummond
    Eduardo C. Xavier
    Journal of Combinatorial Optimization, 2017, 33 : 742 - 778
  • [47] All Pairs Shortest Paths in weighted directed graphs exact and almost exact algorithms
    Zwick, U
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 310 - 319
  • [48] New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
    Gutenberg, Maximilian Probst
    Williams, Virginia Vassilevska
    Wein, Nicole
    arXiv, 2020,
  • [49] New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs
    Gutenberg, Maximilian Probst
    Williams, Virginia Vassilevska
    Wein, Nicole
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 153 - 166
  • [50] Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
    Haitao Wang
    Jie Xue
    Discrete & Computational Geometry, 2020, 64 : 1141 - 1166
12345