Cargando…
Minimum Dominating Sets in Scale-Free Network Ensembles
We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size N and power-law exponent γ, while keeping the average degree fixed. We study ensembles generated by three different network construction methods, and we use a greedy algorit...
Autores principales: | Molnár, F., Sreenivasan, S., Szymanski, B. K., Korniss, G. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3636516/ http://dx.doi.org/10.1038/srep01736 |
Ejemplares similares
-
Dominating Scale-Free Networks Using Generalized Probabilistic Methods
por: Molnár,, F., et al.
Publicado: (2014) -
Building Damage-Resilient Dominating Sets in Complex Networks against Random and Targeted Attacks
por: Molnár, F., et al.
Publicado: (2015) -
Threshold-limited spreading in social networks with multiple initiators
por: Singh, P., et al.
Publicado: (2013) -
Cascading Failures in Spatially-Embedded Random Networks
por: Asztalos, Andrea, et al.
Publicado: (2014) -
Evolution of Opinions on Social Networks in the Presence of Competing Committed Groups
por: Xie, Jierui, et al.
Publicado: (2012)