## All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication (2000)

### Cached

### Download Links

- [www.cs.tau.ac.il]
- [arxiv.org]
- [www.cs.tau.ac.il]
- DBLP

### Other Repositories/Bibliography

by
Uri Zwick

Venue: | Journal of the ACM |

Citations: | 60 - 6 self |

### BibTeX

@ARTICLE{Zwick00allpairs,

author = {Uri Zwick},

title = {All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication},

journal = {Journal of the ACM},

year = {2000},

volume = {49},

pages = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present two new algorithms for solving the All Pairs Shortest Paths (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms. The first algorithm solves...