Fast estimation of diameter and shortest paths (without matrix multiplication)

被引：0
|
作者：
Aingworth, D [1 ]
Chekuri, C [1 ]
Motwani, R [1 ]
机构：
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
来源：
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1996年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：547 / 553
页数：7
相关论文
共 50 条
  • [21] Fast sparse matrix multiplication
    Yuster, R
    Zwick, U
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 604 - 615
  • [22] Fast interval matrix multiplication
    Rump, Siegfried M.
    NUMERICAL ALGORITHMS, 2012, 61 (01) : 1 - 34
  • [23] Fast matrix multiplication is stable
    Demmel, James
    Dumitriu, Ioana
    Holtz, Olga
    Kleinberg, Robert
    NUMERISCHE MATHEMATIK, 2007, 106 (02) : 199 - 224
  • [24] Fast interval matrix multiplication
    Siegfried M. Rump
    Numerical Algorithms, 2012, 61 : 1 - 34
  • [25] Plethysm and fast matrix multiplication
    Seynnaeve, Tim
    COMPTES RENDUS MATHEMATIQUE, 2018, 356 (01) : 52 - 55
  • [26] Two techniques for fast computation of constrained shortest paths
    Chen, Shigang
    Song, Meongchul
    Sahni, Sartaj
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (01) : 105 - 115
  • [27] FAST ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS, WITH APPLICATIONS
    FREDERICKSON, GN
    SIAM JOURNAL ON COMPUTING, 1987, 16 (06) : 1004 - 1022
  • [28] Two techniques for fast computation of constrained shortest paths
    Chen, SG
    Song, MC
    Sahni, S
    GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 1348 - 1352
  • [29] A SIMPLE AND FAST LABEL CORRECTING ALGORITHM FOR SHORTEST PATHS
    BERTSEKAS, DP
    NETWORKS, 1993, 23 (08) : 703 - 709
  • [30] Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions
    Har-Peled, S
    DISCRETE & COMPUTATIONAL GEOMETRY, 1999, 21 (02) : 217 - 231
12345