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 条
  • [1] Fast estimation of diameter and shortest paths (without matrix multiplication)
    Aingworth, D
    Chekuri, C
    Indyk, P
    Motwani, R
    SIAM JOURNAL ON COMPUTING, 1999, 28 (04) : 1167 - 1181
  • [2] Fast estimation of diameter and shortest paths (without matrix multiplication)
    Aingworth, D
    Chekuri, C
    Motwani, R
    PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 547 - 553
  • [3] Fast Algorithms for (max, min)-Matrix Multiplication and Bottleneck Shortest Paths
    Duan, Ran
    Pettie, Seth
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 384 - 391
  • [4] All Pairs Shortest Paths using bridging sets and rectangular matrix multiplication
    Zwick, U
    JOURNAL OF THE ACM, 2002, 49 (03) : 289 - 317
  • [5] Calculating the Shortest Paths by Matrix Approach
    Yuan, Huilin
    Wang, Dingwei
    ADVANCES IN NEURAL NETWORKS - ISNN 2010, PT 1, PROCEEDINGS, 2010, 6063 : 230 - +
  • [6] REVISED MATRIX ALGORITHMS FOR SHORTEST PATHS
    HU, TC
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1967, 15 (01) : 207 - &
  • [7] ERRATA - REVISED MATRIX ALGORITHMS FOR SHORTEST PATHS
    HU, TC
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1967, 15 (06) : 1517 - &
  • [8] Shortest paths between shortest paths
    Kaminski, Marcin
    Medvedev, Paul
    Milanic, Martin
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5205 - 5210
  • [9] Replacement Paths via Fast Matrix Multiplication
    Weimann, Oren
    Yuster, Raphael
    2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 655 - 662
  • [10] Shortest paths in randomly time varying networks
    Cerulli, R
    Festa, P
    Raiconi, G
    2001 IEEE INTELLIGENT TRANSPORTATION SYSTEMS - PROCEEDINGS, 2001, : 854 - 859
12345