2270 search results - page 207 / 454 » On the distribution of eigenvalues of graphs |
190
click to vote
EJC
2008
15 years 6 months ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
171
click to vote
SPAA
2005
ACM
16 years 2 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
153
click to vote
PODC
2004
ACM
15 years 12 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
179
click to vote
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
180
click to vote
ICDCS
2006
IEEE
16 years 17 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...