Results 1  10
of
104,089
AllPairs Bottleneck Paths in Vertex Weighted Graphs
 In Proc. of SODA, 978–985
, 2007
"... Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v), ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
multiplication. Our algorithm is the first subcubic algorithm for this problem. Unlike the subcubic algorithm for the allpairs shortest paths (APSP) problem, that only applies to bounded (or relatively small) integer edge or vertex weights, the algorithm presented for APBP problem works for arbitrary large
Parallel FPGAbased AllPairs ShortestPaths in a Directed Graph
 IN PROCEEDINGS OF THE 20TH IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM
, 2006
"... With rapid advances in VLSI technology, Field Programmable Gate Arrays (FPGAs) are receiving the attention of the Parallel and High Performance Computing community. In this paper, we propose a highly parallel FPGA design for the FloydWarshall algorithm to solve the allpairs shortestpaths problem i ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
With rapid advances in VLSI technology, Field Programmable Gate Arrays (FPGAs) are receiving the attention of the Parallel and High Performance Computing community. In this paper, we propose a highly parallel FPGA design for the FloydWarshall algorithm to solve the allpairs shortestpaths problem
ExternalMemory Exact and Approximate AllPairs ShortestPaths in Undirected Graphs *
, 2004
"... Abstract We present several new externalmemory algorithms for finding allpairs shortest paths in a Vnode, Eedge undirected graph. Our results include the following, where B is the blocksize and Mis the size of internal memory. We present cacheoblivious algorithms with O( V * EB log MB EB) I/Os ..."
Abstract
 Add to MetaCart
/Os for allpairs shortest paths and diameter in unweighted undirected graphs. For weighted undirected graphs we present a cacheaware APSP algorithm that performs O(V * (q V EB + EB log VB)) I/Os. We also present efficient cacheaware algorithms that find paths between all pairs of vertices in anunweighted
ExternalMemory Exact and Approximate AllPairs ShortestPaths in Undirected Graphs
, 2004
"... We present several new externalmemory algorithms for finding allpairs shortest paths in a Vnode, Eedge undirected graph. For allpairs shortest paths and diameter in unweighted undirected graphs we present cacheoblivious algorithnls with O(V. ~ log. ~ ~) I/Os, where B is the blocksize and M is ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present several new externalmemory algorithms for finding allpairs shortest paths in a Vnode, Eedge undirected graph. For allpairs shortest paths and diameter in unweighted undirected graphs we present cacheoblivious algorithnls with O(V. ~ log. ~ ~) I/Os, where B is the blocksize and M
Dynamic Approximate AllPairs Shortest Paths in Undirected Graphs
"... Abstract We obtain three new dynamic algorithms for the approximate allpairs shortest paths problem in unweighted undirected graphs: 1. For any fixed " ? 0, a decremental algorithm withan expected total running time of ~O(mn), where m is the number of edges and n is the number of vertice ..."
Abstract
 Add to MetaCart
Abstract We obtain three new dynamic algorithms for the approximate allpairs shortest paths problem in unweighted undirected graphs: 1. For any fixed " ? 0, a decremental algorithm withan expected total running time of ~O(mn), where m is the number of edges and n is the number of ver
External Memory Algorithms for Diameter and AllPairs ShortestPaths on Sparse Graphs
"... Abstract. We provide I/Oefficient algorithms for diameter and allpairs shortestpaths (APSP) on undirected graphs G(V, E). For general nonnegative edge weights and E/V = o(B / log V) our approaches are the first to achieve o(V 2) I/Os. We also show that unweighted APSP can be solved with just O(V ..."
Abstract
 Add to MetaCart
Abstract. We provide I/Oefficient algorithms for diameter and allpairs shortestpaths (APSP) on undirected graphs G(V, E). For general nonnegative edge weights and E/V = o(B / log V) our approaches are the first to achieve o(V 2) I/Os. We also show that unweighted APSP can be solved with just O
On the ComparisonAddition Complexity of AllPairs Shortest Paths
 In Proc. 13th Int'l Symp. on Algorithms and Computation (ISAAC'02
, 2002
"... We present an allpairs 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 inverseAckermann function. Our algorithm eliminates the sorting bottleneck inherent ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
We present an allpairs 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 inverseAckermann function. Our algorithm eliminates the sorting bottleneck
A Blocked AllPairs ShortestPaths Algorithm
 JOURNAL OF EXPERIMENTAL ALGORITHMICS
, 2003
"... We propose a blocked version of Floyd's allpairs 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 allpairs 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
Results 1  10
of
104,089