4865 search results - page 254 / 973 » The Complexity of Graph Connectivity |
142
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
173
click to vote
SNPD
2007
15 years 7 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
155
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
143
click to vote
SIGCOMM
2009
ACM
16 years 22 days ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
134
click to vote
ETFA
2008
IEEE
16 years 21 days ago
2008
IEEE
The dater equalities constitute a well-known tool which allows the description of Timed Event Graphs in the field of (max, +) algebra. This paper gives an equivalent model in the...