Two fast algorithms for all-pairs shortest paths

DOI10.1016/j.cor.2005.10.013zbMath1141.90564OpenAlexW1985732996MaRDI QIDQ875428

Cees W. Duin

Publication date: 13 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.013

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

A reduction approach to the repeated assignment problem

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A branch-checking algorithm for all-pairs shortest paths
• A new approach to all-pairs shortest paths on real-weighted graphs
• All-pairs shortest paths and the essential subgraph
• Shortest paths algorithms: Theory and experimental evaluation
• All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
• Undirected single-source shortest paths with positive integer weights in linear time
• On a routing problem
• Reduction tests for the steiner problem in grapsh
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
• Planar graph decomposition and all pairs shortest paths
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Two fast algorithms for all-pairs shortest paths