FOCS
13 years 10 months ago
1994 IEEE FOCS
13 years 10 months ago
1994 IEEE
This paper concerns the open problem of Lov
FOCS
13 years 9 months ago
1994 IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
FOCS
13 years 9 months ago
1994 IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
FOCS
13 years 10 months ago
1994 IEEE |