Cargando…
Building Damage-Resilient Dominating Sets in Complex Networks against Random and Targeted Attacks
We study the vulnerability of dominating sets against random and targeted node removals in complex networks. While small, cost-efficient dominating sets play a significant role in controllability and observability of these networks, a fixed and intact network structure is always implicitly assumed....
Autores principales: | Molnár, F., Derzsy, N., Szymanski, B. K., Korniss, G. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4321165/ https://www.ncbi.nlm.nih.gov/pubmed/25662371 http://dx.doi.org/10.1038/srep08321 |
Ejemplares similares
-
Dominating Scale-Free Networks Using Generalized Probabilistic Methods
por: Molnár,, F., et al.
Publicado: (2014) -
Minimum Dominating Sets in Scale-Free Network Ensembles
por: Molnár, F., et al.
Publicado: (2013) -
Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows
por: Moussawi, A., et al.
Publicado: (2017) -
Maximizing Network Resilience against Malicious Attacks
por: Li, Wenguo, et al.
Publicado: (2019) -
Cascading Failures in Spatially-Embedded Random Networks
por: Asztalos, Andrea, et al.
Publicado: (2014)