DMCA
A New Approach to All-Pairs Shortest Paths on Real-Weighted Graphs (2003)
Cached
Download Links
- [www.cs.utexas.edu]
- [www.mpi-sb.mpg.de]
- [web.eecs.umich.edu]
- DBLP
Other Repositories/Bibliography
by
Seth Pettie
| Venue: | Theoretical Computer Science |
| Citations: | 41 - 3 self |
BibTeX
@ARTICLE{Pettie03anew,
author = {Seth Pettie},
title = {A New Approach to All-Pairs Shortest Paths on Real-Weighted Graphs},
journal = {Theoretical Computer Science},
year = {2003},
volume = {312},
pages = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a new all-pairs shortest path algorithm that works with real-weighted graphs in the traditional comparison-addition model. It runs in O(mn+n time, improving on the long-standing bound of O(mn + n log n) derived from an implementation of Dijkstra's algorithm with Fibonacci heaps. Here m and n are the number of edges and vertices, respectively.
