Structural analysis and optimality of vulnerability and efficiency in artificial networks

zbMATH Open1191.05086MaRDI QIDQ3597410FDOQ3597410

Authors: Regino Criado, J. Pello, Miguel Romance, M. Vela-Pérez 

Publication date: 9 February 2009

Recommendations

• VULNERABILITY AND FALL OF EFFICIENCY IN COMPLEX NETWORKS: A NEW APPROACH WITH COMPUTATIONAL ADVANTAGES
• Asymptotic estimates for efficiency, vulnerability and cost for random networks
• Computational Science and Its Applications – ICCSA 2004
• Vulnerability of complex network structures and systems
• Improvements in performance and security for complex networks

zbMATH Keywords

efficiencyrobustnessnetwork designnetwork topologyvulnerabilityoptimal networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Applications of graph theory to circuits and networks (94C15) Applications of design theory to circuits and networks (94C30)

Cited In (4)

• Networks that optimize a trade-off between efficiency and dynamical resilience
• Improvements in performance and security for complex networks
• Probabilistic analysis of efficiency and vulnerability in the Erdös–Rénji model
• Asymptotic estimates for efficiency, vulnerability and cost for random networks

This page was built for publication: Structural analysis and optimality of vulnerability and efficiency in artificial networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597410)