1729 search results - page 154 / 346 » On Bounds for the k-Partitioning of Graphs |
187
click to vote
MOBIHOC
2001
ACM
16 years 6 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...
141
click to vote
STOC
2003
ACM
16 years 6 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...
199
click to vote
IPTPS
2003
Springer
15 years 11 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...
161
click to vote
FAW
2008
Springer
15 years 8 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...
161
click to vote
CSL
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...