The Floyd--Warshall algorithm on graphs with negative cycles

Authors:
Stefan Hougardy
Affiliations:
Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113 Bonn, Germany
Venue:
Information Processing Letters
Year:
2010

Citing 12
Cited 0

A new upper bound on the complexity of the all pairs shortest path problem

Information Processing Letters
Data structures and algorithm analysis (2nd ed.)

Data structures and algorithm analysis (2nd ed.)
Algorithm 97: Shortest path

Communications of the ACM
A new approach to all-pairs shortest paths on real-weighted graphs

Theoretical Computer Science - Special issue on automata, languages and programming
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths

Algorithmica
More algorithms for all-pairs shortest paths in weighted graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A note of an O(n3/logn) time algorithm for all pairs shortest paths

Information Processing Letters
All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time

Algorithmica
An O(n 3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path

Algorithmica
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used to detect the presence of negative cycles. We will show that for this task many existing implementations of the Floyd-Warshall algorithm will fail because exponentially large numbers can appear during its execution.