A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time

DOI10.1007/978-3-642-17461-2_16zbMath1311.05196OpenAlexW1679236828MaRDI QIDQ3066458

Tadao Takaoka, Mashitoh Hashim

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_16

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A Forward-Backward Single-Source Shortest Paths Algorithm

This page was built for publication: A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n 2logn) Expected Time