11 search results - page 1 / 3 » Parallel FPGA-based all-pairs shortest-paths in a directed g... |
FCCM
2006
IEEE
14 years 11 months ago
2006
IEEE
Field-Programmable Gate Arrays (FPGAs) are being employed in high performance computing systems owing to their potential to accelerate a wide variety of long-running routines. Par...
STOC
2003
ACM
15 years 5 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
IPPS
1998
IEEE
14 years 9 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
FOCS
1991
IEEE
14 years 8 months ago
1991
IEEE
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, t...
ALGORITHMICA
2011
14 years 11 days ago
2011
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 smalles...