The Floyd-Warshall algorithm on graphs with negative cycles
type: Item
instance of: scholarly article
title: The Floyd-Warshall algorithm on graphs with negative cycles
zbMATH Open document ID: 1197.05143
author: Stefan Hougardy
published in: Information Processing Letters
publication date: 2010-09-07T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5780817
zbMATH Keywords: Floyd-Warshall algorithm
zbMATH Keywords: design of algorithms
zbMATH Keywords: graph algorithms
Wikidata QID: Q56170981
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.02.001
OpenAlex ID: W2031407623
cites work: More algorithms for all-pairs shortest paths in weighted graphs
cites work: All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
cites work: New Bounds on the Complexity of the Shortest Path Problem
cites work: An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths
cites work: A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
cites work: An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
cites work: Combinatorial optimization. Theory and algorithms.
cites work: A new approach to all-pairs shortest paths on real-weighted graphs
cites work: Q4144192
cites work: A new upper bound on the complexity of the all pairs shortest path problem
cites work: Computing and Combinatorics
cites work: An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
cites work: Q4864244
cites work: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
DOI: 10.1016/J.IPL.2010.02.001
description: scientific article; zbMATH DE number 5780817