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 条

[31] Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions
S. Har-Peled
Discrete & Computational Geometry, 1999, 21 : 217 - 231
[32] On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
Guttmann-Beck, Nili
Hassin, Refael
DISCRETE OPTIMIZATION, 2011, 8 (02) : 302 - 314
[33] SHORTEST-PATH PROBLEM IS NOT HARDER THAN MATRIX MULTIPLICATION
ROMANI, F
INFORMATION PROCESSING LETTERS, 1980, 11 (03) : 134 - 136
[34] IS SHORTEST-PATH PROBLEM NOT HARDER THAN MATRIX MULTIPLICATION
MORAN, S
INFORMATION PROCESSING LETTERS, 1981, 13 (02) : 85 - 86
[35] External matrix multiplication and all-pairs shortest path
Sibeyn, JF
INFORMATION PROCESSING LETTERS, 2004, 91 (02) : 99 - 106
[36] More Accurate Estimation of Shortest Paths in Social Networks
Feng, Chaobing
Deng, Ting
2018 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS FOR BUSINESS ENGINEERING AND SCIENCE (DCABES), 2018, : 314 - 317
[37] Local Search for Fast Matrix Multiplication
Heule, Marijn J. H.
Kauers, Manuel
Seidl, Martina
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2019, 2019, 11628 : 155 - 163
[38] FAST HYBRID MATRIX MULTIPLICATION ALGORITHMS
Jelfimova, L. D.
CYBERNETICS AND SYSTEMS ANALYSIS, 2010, 46 (04) : 563 - 573
[39] STABILITY OF FAST ALGORITHMS FOR MATRIX MULTIPLICATION
BINI, D
LOTTI, G
NUMERISCHE MATHEMATIK, 1980, 36 (01) : 63 - 72
[40] FAST SPARSE-MATRIX MULTIPLICATION
PARK, SC
DRAAYER, JP
ZHENG, SQ
COMPUTER PHYSICS COMMUNICATIONS, 1992, 70 (03) : 557 - 568

← 1 2 3 4 5 →