1493 search results - page 1 / 299 » Local resilience of graphs |
RSA
2008
13 years 4 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
RSA
2011
12 years 11 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
USS
2010
13 years 2 months ago
2010
A key feature that distinguishes modern botnets from earlier counterparts is their increasing use of structured overlay topologies. This lets them carry out sophisticated coordina...