Carregant...
Network dismantling
We study the network dismantling problem, which consists of determining a minimal set of vertices in which removal leaves the network broken into connected components of subextensive size. For a large class of random graphs, this problem is tightly connected to the decycling problem (the removal of...
Guardat en:
| Publicat a: | Proc Natl Acad Sci U S A |
|---|---|
| Autors principals: | , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
National Academy of Sciences
2016
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5098660/ https://ncbi.nlm.nih.gov/pubmed/27791075 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1605083113 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|