Computational geometry: an introduction
Computational geometry: an introduction
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
Clique partitions, graph compression and speeding-up algorithms
Journal of Computer and System Sciences
On the all-pairs-shortest-path problem in unweighted undirected graphs
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
All pairs shortest paths for graphs with small integer length edges
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Introduction to Algorithms
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Improved algorithm for all pairs shortest paths
Information Processing Letters
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
SIAM Journal on Computing
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Many distances in planar graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding a maximum weight triangle in n3-Δ time, with applications
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximate distance oracles for unweighted graphs in expected O(n2) time
ACM Transactions on Algorithms (TALG)
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Necklaces, convolutions, and X + Y
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
All-pairs bottleneck paths in vertex weighted graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Information Processing Letters
Subcubic algorithms for recursive state machines
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Computing rank-convolutions with a mask
ACM Transactions on Algorithms (TALG)
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fast algorithms for the free riders problem in broadcast encryption
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Speeding up HMM decoding and training by exploiting sequence repetitions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We describe an O(n3/log n)-time algorithm for the all-pairs-shortest-paths problem for a real-weighted directed graph with n vertices. This slightly improves a series of previous, slightly subcubic algorithms by Fredman (1976), Takaoka (1992), Dobosiewicz (1990), Han (2004), Takaoka (2004), and Zwick (2004). The new algorithm is surprisingly simple and different from previous ones.