All-pairs shortest paths algorithm for highdimensional sparse graphs

被引：0
|
作者：
Urakov, A. R. [1 ]
Timeryaev, T., V [1 ]
机构：
[1] Ufa State Aviat Tech Univ, Ufa, Russia
来源：
PRIKLADNAYA DISKRETNAYA MATEMATIKA | 2013年 / 19卷 / 01期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：84 / 92
页数：9
相关论文
共 50 条
  • [21] Algorithms for maintaining all-pairs shortest paths
    Misra, S
    Oommen, BJ
    10TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2005, : 116 - 121
  • [22] ALL-PAIRS SHORTEST PATHS AND THE ESSENTIAL SUBGRAPH
    MCGEOCH, CC
    ALGORITHMICA, 1995, 13 (05) : 426 - 441
  • [23] A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths
    Chuzhoy, Julia
    Zhang, Ruimin
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1159 - 1172
  • [24] A Fast Algorithm to Find All-Pairs Shortest Paths in Complex Networks
    Peng, Wei
    Hu, Xiaofeng
    Zhao, Feng
    Su, Jinshu
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2012, 2012, 9 : 557 - 566
  • [25] Minimizing communication in all-pairs shortest paths
    Solomonik, Edgar
    Buluc, Aydin
    Demmel, James
    IEEE 27TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2013), 2013, : 548 - 559
  • [26] Fuzzy all-pairs shortest paths problem
    Seda, Milos
    COMPUTATIONAL INTELLIGENCE, THEORY AND APPLICATION, 2006, : 395 - 404
  • [27] All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time
    Chan, Timothy M.
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
  • [28] A new approach to all-pairs shortest paths on real-weighted graphs
    Pettie, S
    THEORETICAL COMPUTER SCIENCE, 2004, 312 (01) : 47 - 74
  • [29] A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs
    Lima A.M.
    da Silva M.V.G.
    Vignatti A.L.
    Journal of Graph Algorithms and Applications, 2023, 27 (07): : 603 - 619
  • [30] All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time
    Chan, Timothy M.
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 514 - 523
12345