A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
type: Item
instance of: scholarly article
title: A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
zbMATH Open document ID: 1101.68071
author: Uri Zwick
published in: Algorithmica
publication date: 2006-11-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5070972
MaRDI profile type: Publication
full work available at URL: s00453-005-1199-1
OpenAlex ID: W2006570180
DOI: 10.1007/S00453-005-1199-1
Recommended article: Algorithms and Computation
Recommended article: Subcubic cost algorithms for the all pairs shortest path problem
Recommended article: An almost 2-approximation for all-pairs of shortest paths in subquadratic time
Recommended article: A new approach to all-pairs shortest paths on real-weighted graphs
Recommended article: All-pairs shortest paths with a sublinear additive error
Recommended article: All-Pairs Shortest Paths with a Sublinear Additive Error
Recommended article: Q6075915
Recommended article: Computing and Combinatorics
Recommended article: Algorithms and Data Structures
Recommended article: All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
description: scientific article; zbMATH DE number 5070972