172 search results - page 1 / 35 » Program generation for the all-pairs shortest path problem |
IPPS
1998
IEEE
13 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
13 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...
PPSN
2010
Springer
13 years 2 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
WG
2004
Springer
13 years 10 months ago
2004
Springer
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
