Sharing information for the all pairs shortest path problem
type: Item
instance of: scholarly article
title: Sharing information for the all pairs shortest path problem
zbMATH Open document ID: 1358.05288
author: Tadao Takaoka
published in: Theoretical Computer Science
publication date: 2014-01-13T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6244480
zbMATH Keywords: information sharing
zbMATH Keywords: all pairs shortest path problem
zbMATH Keywords: single sink shortest path problem
zbMATH Keywords: priority queue
zbMATH Keywords: nearly acyclic graph
zbMATH Keywords: limited edge cost
describes a project that uses: Algorithm 360
MaRDI profile type: Publication
full work available at URL: j.tcs.2013.09.006
OpenAlex ID: W1980620373
cites work: Faster algorithms for the shortest path problem
cites work: All-pairs shortest paths for unweighted undirected graphs in o(mn) time
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
cites work: A note on two problems in connexion with graphs
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
cites work: A new approach to all-pairs shortest paths on real-weighted graphs
cites work: Improved shortest path algorithms for nearly acyclic graphs
cites work: Solving shortest paths efficiently on nearly acyclic directed graphs
cites work: Shortest path algorithms for nearly acyclic directed graphs
cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem
DOI: 10.1016/J.TCS.2013.09.006
Recommended article: Optimal distributed all pairs shortest paths and applications
Recommended article: All-Pairs Almost Shortest Paths
Recommended article: On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
Recommended article: Q5289052
Recommended article: Solving all-pairs shortest path by single-source computations: theory and practice
Recommended article: Distributed algorithms for computing shortest pairs of disjoint paths
Recommended article: On the exponent of all pairs shortest path problem
Recommended article: Efficient parameterized algorithms for computing all-pairs shortest paths
Recommended article: Q5874311
Recommended article: Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
description: scientific article; zbMATH DE number 6244480