Sciweavers

1404 search results - page 10 / 281
» On General Laws of Complex Networks
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
INFOCOM
2005
IEEE
14 years 29 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
HYBRID
2007
Springer
13 years 11 months ago
Piecewise Constant Feedback Control of Piecewise Affine Gene Network Models
Abstract. The use of hybrid dynamical systems to model gene regulation is impelled by the switch-like behaviour of the latter. Piecewise affine differential equations is one of the...
Etienne Farcot, Jean-Luc Gouzé
SAC
2006
ACM
14 years 1 months ago
Mining and analyzing the topological structure of protein-protein interaction networks
We report a comprehensive evaluation of the topological structure of protein-protein interaction (PPI) networks by mining and analyzing graphs constructed from the publicly availa...
Daniel Duanqing Wu, Xiaohua Hu
COCOON
2007
Springer
14 years 1 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...