552 search results - page 12 / 111 » Lower bounds for dynamic connectivity |
JGT
2007
14 years 9 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law respects the limited sensing cap...
EJC
2011
14 years 4 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
AAECC
2003
Springer
15 years 3 months ago
2003
Springer
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...
188
click to vote
STOC
2012
ACM
13 years 6 days ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...