An O(n log log n/ log n) Time Algorithm for the All-Pairs Shortest Path Problem
نویسنده
چکیده
We design a faster algorithm for the all-pairs shortest path problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we improve the best known time complexity of O(n(log log n)/ logn) to O(n log log n/ log n). As an application, we show the k-maximum subarray problem can be solved in O(kn log log n/ log n) time for small k.
منابع مشابه
An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
We present an O(n log log n/ log n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n(log log n)/ log n) time.
متن کاملAn O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem
In this paper we consider the all-pairs shortest path (APSP) problem, which computes shortest paths between all pairs of vertices of a directed graph with non-negative real numbers as edge costs. We present an algorithm that computes shortest distances between all pairs of vertices, since shortest paths can be computed as by-products in our algorithm. It is well known that the time complexity o...
متن کاملFinding the k Shortest Paths in
A concurrent-read exclusive-write PRAM algorithm is developed to nd the k shortest paths between pairs of vertices in an edge-weighted directed graph. Repetitions of vertices along the paths are allowed. The algorithm computes an implicit representation of the k shortest paths to a given destination vertex from every vertex of a graph with n vertices and m edges, using O(m + nk log 2 k) work an...
متن کاملFast Algorithms for Shortest Paths in Planar Graphs, with Applications
Graph decomposition and data structures techniques are presented that exploit the structure of planar graphs to yield faster algorithms for a number of shortest path and related problems. Improved algorithms are presented for the single source problem, the all pairs problem, the problem of finding a minimum Cut in an undirected graph, and testing the feasibility of a multicomrnodity flow when a...
متن کاملEfficient Parallel Algorithms for Shortest Paths in Planar Graphs
Efficient parallel algorithms are presented, on the CREW PRAM model, for generating a succinct encoding of all pairs shortest path information in a directed planar graph G with real-valued edge costs but no negative cycles. We assume that a planar embedding of G is given, togetber with a set of q faces that cover all the vertices. Then our algorithm runs in O(log 2 n) time and employs O{nq + M(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004