270 search results - page 54 / 54 » Diameter bounds for planar graphs |
CCS
2011
ACM
12 years 5 months ago
2011
ACM
Verifying that access-control systems maintain desired security properties is recognized as an important problem in security. Enterprise access-control systems have grown to prote...
MOBIHOC
2004
ACM
14 years 5 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
ADHOCNOW
2007
Springer
13 years 11 months ago
2007
Springer
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
CPM
2004
Springer
13 years 10 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...