3008 search results - page 196 / 602 » Independence in connected graphs |
182
click to vote
SNPD
2007
15 years 8 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...
161
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...
156
click to vote
SIGCOMM
2009
ACM
16 years 1 months 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...
137
click to vote
ETFA
2008
IEEE
16 years 1 months 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...
199
click to vote
WEBI
2007
Springer
16 years 20 days ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...