2283 search results - page 144 / 457 » Bounds of Graph Characteristics |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
IPTPS
2003
Springer
14 years 1 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
FAW
2008
Springer
13 years 10 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...