24 search results - page 2 / 5 » On the All-Pairs Shortest Path Algorithm of Moffat and Takao... |
SODA
2004
ACM
13 years 7 months ago
2004
ACM
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
STOC
2003
ACM
14 years 6 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...
FOCS
1991
IEEE
13 years 9 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...
FCCM
2006
IEEE
13 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...