Answering distance queries in directed graphs using fast matrix multiplication

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 389-396

  Yuster, Raphael ^a   Zwick, Uri ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; FAST MATRIX MULTIPLICATION; SINGLE SOURCE SHORTEST PATHS (SSSP) PROBLEM; TIME ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; QUERY LANGUAGES;

MATRIX ALGEBRA;

EID: 33748051465     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.20     Document Type: Conference Paper

References (15)

1. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. Journal of Computer and System Sciences, 54:255-262, 1997.
2. R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87-90, 1958.
3. D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Complexity, 13:42-49, 1997.
4. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
5. E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
6. M. Fredman and R. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
7. H. Gablow and R. Tarjan. Faster scaling algorithms for general graph matching problems. Journal of the ACM, 38(4):815-853, 1991.
8. A. Goldberg. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, 24(3):494-504, 1995.
9. X. Huang and V. Pan. Fast rectangular matrix multiplications and applications. Journal of Complexity, 14:257-299, 1998.
10. D. Johnson. Efficient algorithms for shortest paths in sparse graphs. Journal of the ACM, 24:1-13, 1977.
11. A. Shoshan and U. Zwick. All pairs shortest paths in undirected graphs with integer weights. In Proc. of 40th FOCS, pages 605-614, 1999.
12. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46:362-394, 1999.
13. M. Thorup and U. Zwick. Approximate distance oracles. Journal of the ACM, 52(1): 1-24, 2005.
14. 2.81 infinite-precision multiplications. Information Processing Letters, 4:155-156, 1976.
15. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49:289-317, 2002.