838 search results - page 16 / 168 » On the Robustness of Complex Networks by Using the Algebraic... |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
AAIM
2005
Springer
14 years 1 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The study of the sub-structure of complex networks is of major importance to relate topology and functionality. Many efforts have been devoted to the analysis of the modular struc...
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...