63 search results - page 4 / 13 » Random Graph Coverings I: General Theory and Graph Connectiv... |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
MSWIM
2004
ACM
14 years 1 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
SIGMETRICS
2012
ACM
11 years 10 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...