An O(n^3( n / n )^5/4) time algorithm for all pairs shortest path

DOI10.1007/S00453-007-9063-0MaRDI QIDQ930607zbMATH OpenOpenAlexFDO

Authors Yijie Han

Publication date 1 July 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9063-0

zbMATH Keywords

AlgorithmsComplexityGraph algorithmsShortest path

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites work

• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 2086613 (Why is no real title available?)
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs
• A more efficient algorithm for the min-plus multiplication
• A new upper bound on the complexity of the all pairs shortest path problem
• Algorithms and Computation
• Algorithms and Data Structures
• Algorithms – ESA 2005
• All pairs shortest distances for graphs with small integer length edges
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
• Improved algorithm for all pairs shortest paths
• Improved parallel integer sorting without concurrent writing
• New Bounds on the Complexity of the Shortest Path Problem
• On the all-pairs-shortest-path problem in unweighted undirected graphs.
• Undirected single-source shortest paths with positive integer weights in linear time

Cited in

(9)

• Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
• Faster all-pairs shortest paths via circuit complexity
• Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound
• Average-case complexity of the min-sum matrix product problem
• An O(n^3 n / ^2 n) time algorithm for all pairs shortest paths
• The Floyd-Warshall algorithm on graphs with negative cycles
• From circuit complexity to faster all-pairs shortest paths
• An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
• A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time

This page was built for publication: An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930607)