1k citations · 2k across the 14 of their papers we have counts for
3 papers · 1 filter
Efficient algorithm to study interconnected networks
Christian M. Schneider, Nuno A. M. Araújo, Hans J. Herrmann
Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identific…
Optimal box-covering algorithm for fractal dimension of complex networks
Christian M. Schneider, Tobias A. Kesselring, Jose S. Andrade +1
The self-similarity of complex networks is typically investigated through computational algorithms the primary task of which is to cover the structure with a minimal number of boxe…
Protein Interaction Networks are Fragile against Random Attacks and Robust against Malicious Attacks
Christian M. Schneider, Roberto F. S. Andrade, Troy Shinbrot +1
The capacity to resist attacks from the environment is crucial to the survival of all organisms. We quantitatively analyze the susceptibility of protein interaction networks of num…