63 search results - page 5 / 13 » Constructing vertex-disjoint paths in (n, k)-star graphs |
153
click to vote
ESA
1994
Springer
15 years 10 months ago
1994
Springer
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 graph having the points of S as its vertices such that for any pair p, q of points ther...
161
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
162
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
122
click to vote
ARSCOM
2005
15 years 6 months ago
2005
For each integer m 1, consider the graph Gm whose vertex set is the set N = {0, 1, 2, . . . } of natural numbers and whose edges are the pairs xy with y = x + m or y = x - m or y...
150
click to vote
MST
2010
15 years 4 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...