Results 241 to 250 of about 848,584 (267)
Some of the next articles are maybe not open access.
Advances in Complex Systems, 2009
This topical issue features regular submissions to Advances in Complex Systems focusing on ‘Complex Networks’ from different perspectives. They have been selected by the editors to appear together in this issue, to highlight current research trends. ‘Complex Networks’ is a booming research area for quite a few years now.
Enrico Scalas, Frank Schweitzer
openaire +3 more sources
This topical issue features regular submissions to Advances in Complex Systems focusing on ‘Complex Networks’ from different perspectives. They have been selected by the editors to appear together in this issue, to highlight current research trends. ‘Complex Networks’ is a booming research area for quite a few years now.
Enrico Scalas, Frank Schweitzer
openaire +3 more sources
On the network complexity of selection
30th Annual Symposium on Foundations of Computer Science, 1989The sequential complexity of determining the kth largest out of a given set of n keys is known to be linear. Thus, given a p-processor parallel machine, it is asked whether or not an O(n/p) selection algorithm can be devised for that machine. An Omega ((n/p) log log p+log p) lower bound is obtained for selection on any network that satisfies a ...
openaire +1 more source
Clustering in Complex Networks
2004Real, mostly socially rooted networks have the tendency to form the simplest morphological structures observable: triangles, or in other words mutually linked triples of nodes. This is captured by the concept of clustering. We review a few milestones in the quantitative description of this feature, together with selected models that reproduce certain ...
Szabó, G, Alava, M J, Kertész, János
openaire +2 more sources
Coefficient of Network Complexity
Management Science, 1974The degree of complexity of a critical path network may be classified by calculating a Coefficient of Network Complexity. It is defined as the quotient of activities squared divided by events or preceding work items squared divided by work items. Three distinct contributions are offered.
openaire +2 more sources
A survey on state estimation of complex dynamical networks
International Journal of Systems Science, 2021Jun Hu, Chaoqing Jia, Hongjian Liu
exaly
Assortativity in complex networks
Journal of Complex Networks, 2015Rogier Noldus, Piet Van Mieghem
openaire +1 more source
Influence maximization in complex networks through optimal percolation
Nature, 2015Flaviano Morone +2 more
exaly