On the all-pairs-shortest-path problem in unweighted undirected graphs

被引：0
|
作者：
Univ of California, Berkeley, Berkeley, United States [1 ]
机构：
来源：
J Comput Syst Sci | / 3卷 / 400-403期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Incremental FO(+,<) maintenance of all-pairs shortest paths for undirected graphs after insertions and deletions
    Pang, CY
    Kotagiri, R
    Dong, GZ
    [J]. DATABASE THEORY - ICDT'99, 1999, 1540 : 365 - 382
  • [32] Sub-cubic cost algorithms for the all pairs shortest path problem
    Takaoka, T
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 333 - 343
  • [33] More effective crossover operators for the all-pairs shortest path problem
    Doerr, Benjamin
    Johannsen, Daniel
    Koetzing, Timo
    Neumann, Frank
    Theile, Madeleine
    [J]. THEORETICAL COMPUTER SCIENCE, 2013, 471 : 12 - 26
  • [34] Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
    Brown, Gerald G.
    Carlyle, W. Matthew
    [J]. INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 279 - 288
  • [35] NOTE ON SPIRAS ALGORITHM FOR ALL-PAIRS SHORTEST-PATH PROBLEM
    CARSON, JS
    LAW, AM
    [J]. SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 696 - 699
  • [36] A faster algorithm for the all-pairs shortest path problem and its application
    Takaoka, T
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 278 - 289
  • [37] A Heterogeneous Solution to the All-pairs Shortest Path Problem using FPGAs
    Chirila, Mihnea
    D'Alberto, Paolo
    Ting, Hsin-Yu
    Veidenbaum, Alexander
    Nicolau, Alexandru
    [J]. PROCEEDINGS OF THE TWENTY THIRD INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED 2022), 2022, : 108 - 113
  • [38] SCALABILITY OF PARALLEL ALGORITHMS FOR THE ALL-PAIRS SHORTEST-PATH PROBLEM
    KUMAR, V
    SINGH, V
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (02) : 124 - 138
  • [39] More Effective Crossover Operators for the All-Pairs Shortest Path Problem
    Doerr, Benjamin
    Johannsen, Daniel
    Koetzing, Timo
    Neumann, Frank
    Theile, Madeleine
    [J]. PARALLEL PROBLEMS SOLVING FROM NATURE - PPSN XI, PT I, 2010, 6238 : 184 - +
  • [40] A SHARPER ANALYSIS OF A PARALLEL ALGORITHM FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
    GU, QP
    TAKAOKA, T
    [J]. PARALLEL COMPUTING, 1990, 16 (01) : 61 - 67
12345