Results 221 to 230 of about 7,591,420 (248)
Some of the next articles are maybe not open access.

Clustering in Complex Networks

2004
Real, 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

On the Complexity of Network Synchronization

SIAM Journal on Computing, 2004
We show that if a minimal-time solution to a fundamental distributed computation primitive, synchronizing a network path of finite-state processors, exists on the three-dimensional, undirected grid, then we can conclude the purely complexity-theoretic result P=NP. Every previous result on network synchronization for various network topologies either
Darin Goldstein, Kojiro Kobayashi
openaire   +3 more sources

EDITORIAL: COMPLEX NETWORKS

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

Correlations in Complex Networks

2007
This book is the culmination of three years of research effort on a multidisciplinary project in which physicists, mathematicians, computer scientists and social scientists worked together to arrive at a unifying picture of complex networks. The contributed chapters form a reference for the various problems in data analysis visualization and modeling ...
Serrano Moral, Maria Angeles   +3 more
openaire   +3 more sources

On the network complexity of selection

30th Annual Symposium on Foundations of Computer Science, 1989
The 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

Provisioning in complex networks

Bell Labs Technical Journal, 2007
IP Multimedia Subsystem (IMS) solutions emphasize services including all-Internet Protocol (IP) voice, data, video, multimedia, and other user-centric services. IMS applications allow network convergence among wireline, wireless, and packet networks and interaction of services in disparate, multivendor, multitechnology networks. This increased level of
openaire   +1 more source

Network complexity

1977
Hotz, Günter, Stadel, Manfred
openaire   +2 more sources

Signal propagation in complex networks

Physics Reports, 2023
Yu Mu, Matjaž Perc, Peng Ji
exaly  

Controlling complex networks with complex nodes

Nature Reviews Physics, 2023
Mario di Bernardo   +2 more
exaly  

A survey on state estimation of complex dynamical networks

International Journal of Systems Science, 2021
Hongjian Liu, Yurong Liu, Jun Hu
exaly  

Home - About - Disclaimer - Privacy