Answering distance queries in directed graphs using fast matrix multiplication

Authors:
Raphael Yuster;Uri Zwick
Affiliations:
University of Haifa;Tel Aviv University
Venue:
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Year:
2005

Citing 12
Cited 11

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Faster scaling algorithms for general graph matching problems

Journal of the ACM (JACM)
Scaling Algorithms for the Shortest Paths Problem

SIAM Journal on Computing
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
Rectangular matrix multiplication revisited

Journal of Complexity
Fast rectangular matrix multiplication and applications

Journal of Complexity
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
All pairs shortest paths using bridging sets and rectangular matrix multiplication

Journal of the ACM (JACM)
All Pairs Shortest Paths in Undirected Graphs with Integer Weights

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximate distance oracles

Journal of the ACM (JACM)

Colored intersection searching via sparse rectangular matrix multiplication

Proceedings of the twenty-second annual symposium on Computational geometry
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
Algebraic Graph Algorithms

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On-line exact shortest distance query processing

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Maximum weight bipartite matching in matrix multiplication time

Theoretical Computer Science
On-line preferential nearest neighbor browsing in large attributed graphs

DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Shortest paths in matrix multiplication time

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Faster replacement paths

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Weighted bipartite matching in matrix multiplication time

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G = (V, E,w) be a weighted directed graph, where w : \rm E \to{-M, . . . , 0, . . . , M}.We show that G can be preprocessed in O(m^\omega) time,where \omega n^{\omega - 1/2} \simeq n^{1.876}.