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 条

[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 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
[3] Shortest paths in matrix multiplication time
Sankowski, P
ALGORITHMS - ESA 2005, 2005, 3669 : 770 - 778
[4] Replacement Paths via Fast Matrix Multiplication
Weimann, Oren
Yuster, Raphael
2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 655 - 662
[5] All Pairs Shortest Paths using bridging sets and rectangular matrix multiplication
Zwick, U
JOURNAL OF THE ACM, 2002, 49 (03) : 289 - 317
[6] SHORTEST PATHS WITHOUT A MAP
PAPADIMITRIOU, CH
YANNAKAKIS, M
THEORETICAL COMPUTER SCIENCE, 1991, 84 (01) : 127 - 150
[7] FAST MATRIX MULTIPLICATION WITHOUT APA-ALGORITHMS
PAN, V
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1982, 8 (05) : 343 - 366
[8] Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
Weimann, Oren
Yuster, Raphael
ACM TRANSACTIONS ON ALGORITHMS, 2013, 9 (02)
[9] Calculating the Shortest Paths by Matrix Approach
Yuan, Huilin
Wang, Dingwei
ADVANCES IN NEURAL NETWORKS - ISNN 2010, PT 1, PROCEEDINGS, 2010, 6063 : 230 - +
[10] REVISED MATRIX ALGORITHMS FOR SHORTEST PATHS
HU, TC
SIAM JOURNAL ON APPLIED MATHEMATICS, 1967, 15 (01) : 207 - &

← 1 2 3 4 5 →