552 search results - page 62 / 111 » Lower bounds for dynamic connectivity |
ISAAC
2001
Springer
14 years 2 months ago
2001
Springer
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
COCOON
1999
Springer
14 years 1 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
WG
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
STOC
1991
ACM
14 years 1 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
APVIS
2007
13 years 11 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...