Results 1 - 10 of 4,598

A Blocked All-Pairs Shortest-Paths Algorithm

by Gayathri Venkataraman , Sartaj Sahni, Srabani Mukhopadhyaya - JOURNAL OF EXPERIMENTAL ALGORITHMICS , 2003
"... We propose a blocked version of Floyd's all-pairs shortestpaths algorithm. The blocked algorithm makes better utilization of cache than does Floyd's original algorithm. Experiments indicate that the blocked algorithm delivers a speedup (relative to the unblocked Floyd's algorithm) ..."
Abstract - Cited by 21 (0 self) - Add to MetaCart
We propose a blocked version of Floyd's all-pairs shortestpaths algorithm. The blocked algorithm makes better utilization of cache than does Floyd's original algorithm. Experiments indicate that the blocked algorithm delivers a speedup (relative to the unblocked Floyd's algorithm

On the All-Pairs Shortest-Path Algorithm Of Moffat and Takaoka

by Kurt Mehlhorn, Volker Priebe , 1997
"... We review how to solve the all-pairs shortest-path problem in a nonnegatively Ž 2 weighted digraph with n vertices in expected time On log n.. This bound is shown to hold with high probability for a wide class of probability distributions on nonnegatively weighted digraphs. We also prove that, for ..."
Abstract - Cited by 14 (4 self) - Add to MetaCart
We review how to solve the all-pairs shortest-path problem in a nonnegatively Ž 2 weighted digraph with n vertices in expected time On log n.. This bound is shown to hold with high probability for a wide class of probability distributions on nonnegatively weighted digraphs. We also prove that

Finding the k Shortest Paths

by David Eppstein , 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract - Cited by 401 (2 self) - Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest

On the Comparison-Addition Complexity of All-Pairs Shortest Paths

by Seth Pettie - In Proc. 13th Int'l Symp. on Algorithms and Computation (ISAAC'02 , 2002
"... We present an all-pairs shortest path algorithm for arbitrary graphs that performs O(mn log (m; n)) comparison and addition operations, where m and n are the number of edges and vertices, resp., and is Tarjan's inverse-Ackermann function. Our algorithm eliminates the sorting bottleneck inherent ..."
Abstract - Cited by 10 (6 self) - Add to MetaCart
We present an all-pairs shortest path algorithm for arbitrary graphs that performs O(mn log (m; n)) comparison and addition operations, where m and n are the number of edges and vertices, resp., and is Tarjan's inverse-Ackermann function. Our algorithm eliminates the sorting bottleneck

All-Pairs Shortest Paths and the Essential Subgraph

by C. C. McGeoch , 1995
"... The essential subgraph H of a weighted graph or digraph G contains an edge (v, w) if that edge is uniquely the least-cost path between its vertices. Let s denote the number of edges of H. This paper presents an algorithm for solving all-pairs shortest paths on G that requires O(ns + n 2 log n) wor ..."
Abstract - Cited by 16 (2 self) - Add to MetaCart
The essential subgraph H of a weighted graph or digraph G contains an edge (v, w) if that edge is uniquely the least-cost path between its vertices. Let s denote the number of edges of H. This paper presents an algorithm for solving all-pairs shortest paths on G that requires O(ns + n 2 log n

Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths

by David R. Karger, Daphne Koller, Steven J. Phillips , 1993
"... We investigate the all-pairs shortest paths problem in weighted graphs. We present an algorithm---the Hidden Paths Algorithm---that finds these paths in time O(m* n+n² log n), where m is the number of edges participating in shortest paths. Our algorithm is a practical substitute for Dijkstra&ap ..."
Abstract - Cited by 75 (0 self) - Add to MetaCart
We investigate the all-pairs shortest paths problem in weighted graphs. We present an algorithm---the Hidden Paths Algorithm---that finds these paths in time O(m* n+n² log n), where m is the number of edges participating in shortest paths. Our algorithm is a practical substitute for Dijkstra

More algorithms for all-pairs shortest paths in weighted graphs

by Timothy M. Chan - In Proceedings of 39th Annual ACM Symposium on Theory of Computing , 2007
"... In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n 3 log 3 log n / log 2 n), which improves all known algorithms for general real-weighted dense graphs. In the second part of the paper, we use fast matrix multipl ..."
Abstract - Cited by 75 (3 self) - Add to MetaCart
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n 3 log 3 log n / log 2 n), which improves all known algorithms for general real-weighted dense graphs. In the second part of the paper, we use fast matrix

Program Generation for the All-Pairs Shortest Path Problem

by Sung-chul Han, Franz Franchetti, Markus Püschel , 2006
"... A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly complex computing platforms. Examples include ATLAS, SPI-RAL, 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 well-known Floyd-Warshall (FW) algorithm that solves the all-pairs shortest path problem, which is important in a wide range of engineering applications

Fibonacci Heaps and Their Uses in Improved Network optimization algorithms

by Michael L. Fredman, Robert Endre Tarjan , 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized tim ..."
Abstract - Cited by 739 (18 self) - Add to MetaCart
in the problem graph: ( 1) O(n log n + m) for the single-source shortest path problem with nonnegative edge lengths, improved from O(m logfmh+2)n); (2) O(n*log n + nm) for the all-pairs shortest path problem, improved from O(nm lo&,,,+2,n); (3) O(n*logn + nm) for the assignment problem (weighted bipartite

Scalability of parallel algorithms for the all-pairs shortest path problem

by Vipin Kumar, Vineet Singh - 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
Results 1 - 10 of 4,598