Dominating Scale-Free Networks Using Generalized Probabilistic Methods

We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for applications. We propose two novel probabilistic dominating set selec...

Descripción completa

Detalles Bibliográficos
Autores principales: Molnár,, F., Derzsy, N., Czabarka, É., Székely, L., Szymanski, B. K., Korniss, G.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2014
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4158322/
https://www.ncbi.nlm.nih.gov/pubmed/25200937
http://dx.doi.org/10.1038/srep06308

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4158322/
https://www.ncbi.nlm.nih.gov/pubmed/25200937
http://dx.doi.org/10.1038/srep06308

Ejemplares similares