Carregant...
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...
Guardat en:
| Autors principals: | , , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Nature Publishing Group
2014
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4158322/ https://ncbi.nlm.nih.gov/pubmed/25200937 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/srep06308 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|