More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
type: Item
instance of: scholarly article
title: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
zbMATH Open document ID: 1207.68436
DOI: 10.1137/08071990X
author: Timothy M. Chan
published in: SIAM Journal on Computing
publication date: 2010-11-04T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5810178
zbMATH Keywords: shortest paths
zbMATH Keywords: graph algorithms
zbMATH Keywords: small-integer-weighted graphs
zbMATH Keywords: computational geometry
zbMATH Keywords: matrix multiplication
zbMATH Keywords: APSP
Wikidata QID: Q56170983
MaRDI profile type: Publication
full work available at URL: 08071990x
OpenAlex ID: W3022326557
Recommended article: A new approach to all-pairs shortest paths on real-weighted graphs
Recommended article: A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs.
Recommended article: Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Recommended article: On the all-pairs-shortest-path problem in unweighted undirected graphs.
Recommended article: All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
Recommended article: A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
Recommended article: Q4737147
Recommended article: Two fast algorithms for all-pairs shortest paths
Recommended article: Computing and Combinatorics
Recommended article: All-Pairs Almost Shortest Paths
description: scientific article