Results 1  10
of
4,190
1 Algorithms of All Pair Shortest Path Problem
"... This paper is based on survey of various algorithms for all pair shortest path problem (APSP) on arbitrary real weighted directed graphs.This paper has summarized existing methods for solving shortestpath problems. In particular, we have addressed both sequential and parallel algorithms. We begin w ..."
Abstract
 Add to MetaCart
This paper is based on survey of various algorithms for all pair shortest path problem (APSP) on arbitrary real weighted directed graphs.This paper has summarized existing methods for solving shortestpath problems. In particular, we have addressed both sequential and parallel algorithms. We begin
Program Generation for the AllPairs Shortest Path Problem
, 2006
"... A recent trend in computing are domainspecific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fastchanging and increasingly complex computing platforms. Examples include ATLAS, SPIRAL, and the codelet generator in FFTW. Each of these generators prod ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
produces highly optimized source code directly from a problem specification. In this paper, we extend this list by a program generator for the wellknown FloydWarshall (FW) algorithm that solves the allpairs shortest path problem, which is important in a wide range of engineering applications
On the exponent of the all pairs shortest path problem
"... The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for t ..."
Abstract

Cited by 84 (2 self)
 Add to MetaCart
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even
A Computational Study Of Parallel Algorithms For The AllPairs Shortest Path Problem
, 1994
"... This paper presents experiences from the implementation of parallel algorithms for the allpairs shortest path problem. A brief survey of the problem is given and efficient techniques for exploiting the memory hierarchy of parallel computers are described. Comparing the algorithms at a practical ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents experiences from the implementation of parallel algorithms for the allpairs shortest path problem. A brief survey of the problem is given and efficient techniques for exploiting the memory hierarchy of parallel computers are described. Comparing the algorithms at a practical
Scalability of parallel algorithms for the allpairs shortest path problem
 IN THE PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING
, 1991
"... This paper uses the isoefficiency metric to analyze the scalability of several parallel algorithms for finding shortest paths between all pairs of nodes in a densely connected graph. Parallel algorithms analyzed in this paper have either been previously presented elsewhere or are small variations ..."
Abstract

Cited by 38 (13 self)
 Add to MetaCart
This paper uses the isoefficiency metric to analyze the scalability of several parallel algorithms for finding shortest paths between all pairs of nodes in a densely connected graph. Parallel algorithms analyzed in this paper have either been previously presented elsewhere or are small variations
A Symbolic Approach to the AllPairs ShortestPaths Problem
 In WG 2004, LNCS 3353
, 2004
"... Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, specialized symbolic algorithms are needed which are restricted to the use of functional operations offered by the OBDD ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
data structure. In this paper, a symbolic algorithm for the allpairs shortestpaths (APSP) problem in loopless directed graphs with strictly positive integral edge weights is presented. It requires Θ ( log 2 (NB) ) OBDDoperations to obtain the lengths and edges of all shortest paths in graphs with N
An O(n 3 log log n / log n) Time Algorithm for the AllPairs Shortest Path Problem
, 2004
"... We design a faster algorithm for the allpairs 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 3 (log log n) 2 / log n) to O(n 3 log log n / log n). As an application, we show the km ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We design a faster algorithm for the allpairs 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 3 (log log n) 2 / log n) to O(n 3 log log n / log n). As an application, we show the k
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
 Algorithmica
, 1995
"... . In this paper we give three subcubic cost algorithms for the all pairs shortest distance (APSD) and path (APSP) problems. The first is a parallel algorithm that solves the APSD problem for a directed graph with unit edge costs in O(log 2 n) time with O(n ffi p log n) processors where = 2:68 ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
. In this paper we give three subcubic cost algorithms for the all pairs shortest distance (APSD) and path (APSP) problems. The first is a parallel algorithm that solves the APSD problem for a directed graph with unit edge costs in O(log 2 n) time with O(n ffi p log n) processors where = 2
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems
, 1990
"... An algorithm is presented for generating a succinct encoding of all pairs shortest path information in an nvertex directed graph G with O(n) edges. The edges have realvalued costs, but the graph contains no negative cycles. The algorithm runs in O('Y(G)n + ('Y(G))'log 'Y(G)) ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
An algorithm is presented for generating a succinct encoding of all pairs shortest path information in an nvertex directed graph G with O(n) edges. The edges have realvalued costs, but the graph contains no negative cycles. The algorithm runs in O('Y(G)n + ('Y(G))'log &apos
Results 1  10
of
4,190