3008 search results - page 437 / 602 » Independence in connected graphs |
199
click to vote
HIS
2009
15 years 4 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
207
click to vote
AUTOMATICA
2011
15 years 2 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
231
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper we address the problem of physical node capture attacks in wireless sensor networks and provide a control theoretic framework to model physical node capture, cloned n...
179
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
The study focuses on a class of discrete-time multi-agent systems modelling opinion dynamics with decaying confidence. Essentially, we propose an agreement protocol that impose a p...
175
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...