11 search results - page 1 / 3 » Witnesses for Boolean Matrix Multiplication and for Shortest... |
FOCS
1992
IEEE
13 years 8 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...
ALGORITHMICA
2011
12 years 11 months 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...
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
SODA
1996
ACM
13 years 6 months ago
1996
ACM