Shortest paths in matrix multiplication time

被引：0
|
作者：
Sankowski, P [1 ]
机构：
[1] Warsaw Univ, Inst Informat, PL-02097 Warsaw, Poland
来源：
ALGORITHMS - ESA 2005 | 2005年 / 3669卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we present an (O) over tilde (Wn(w)) time algorithm solving single source shortest path problem in graphs with integer weights from the set {-W,..., 0,..., W}, where omega < 2.376 is the matrix multiplication exponent. For dense graphs with small edge weights, this result improves upon the algorithm of Goldberg that works in (O) over tilde (mn(0.5) log W) time, and the Bellman-Ford algorithm that works in O(nm) time.
引用
收藏
页码：770 / 778
页数：9
相关论文
共 50 条
  • [41] Updating shortest paths
    Edelkamp, S
    ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 655 - 659
  • [42] On Universal Shortest Paths
    Turner, Lara
    Hamacher, Horst W.
    OPERATIONS RESEARCH PROCEEDINGS 2010, 2011, : 313 - 318
  • [43] SHORTEST PATHS IN PORTALGONS
    Ophelders, Tim
    Loeffler, Maarten
    Silveira, Rodrigo I.
    Staals, Frank
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2024, 15 (02) : 174 - 221
  • [44] Shortest paths in a network with time-dependent flow speeds
    Sung, K
    Bell, MGH
    Seong, M
    Park, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 121 (01) : 32 - 39
  • [45] An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
    Yevgeny Schreiber
    Discrete & Computational Geometry, 2010, 43 : 21 - 53
  • [46] Shortest paths computation of graph by neural networks in real time
    Zhu, DM
    Ma, SH
    ICSP '96 - 1996 3RD INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, PROCEEDINGS, VOLS I AND II, 1996, : 1461 - 1464
  • [47] A polynomial-time algorithm to find Shortest Paths with Recourse
    Provan, JS
    NETWORKS, 2003, 41 (02) : 115 - 125
  • [48] An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
    Schreiber, Yevgeny
    DISCRETE & COMPUTATIONAL GEOMETRY, 2010, 43 (01) : 21 - 53
  • [49] Bicriterion Shortest Paths in Stochastic Time-Dependent Networks
    Nielsen, Lars Relund
    Pretolani, Daniele
    Andersen, Kim Allan
    MULTIOBJECTIVE PROGRAMMING AND GOAL PROGRAMMING: THEORETICAL RESULTS AND PRACTICAL APPLICATIONS, 2009, 618 : 57 - +
  • [50] Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
    Weimann, Oren
    Yuster, Raphael
    ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (02)
12345