2270 search results - page 384 / 454 » On the distribution of eigenvalues of graphs |
175
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
192
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
176
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
180
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
145
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...