Cargando…
Fast and simple decycling and dismantling of networks
Decycling and dismantling of complex networks are underlying many important applications in network science. Recently these two closely related problems were tackled by several heuristic algorithms, simple and considerably sub-optimal, on the one hand, and involved and accurate message-passing ones...
Autores principales: | Zdeborová, Lenka, Zhang, Pan, Zhou, Hai-Jun |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5126572/ https://www.ncbi.nlm.nih.gov/pubmed/27897223 http://dx.doi.org/10.1038/srep37954 |
Ejemplares similares
-
Determinants of cyclization–decyclization kinetics of short DNA with sticky ends
por: Jeong, Jiyoun, et al.
Publicado: (2020) -
Sketching methods with small window guarantee using minimum decycling sets
por: Marçais, Guillaume, et al.
Publicado: (2023) -
Efficient minimizer orders for large values of k using minimum decycling sets
por: Pellow, David, et al.
Publicado: (2023) -
Generalized network dismantling
por: Ren, Xiao-Long, et al.
Publicado: (2019) -
A comparative analysis of approaches to network-dismantling
por: Wandelt, Sebastian, et al.
Publicado: (2018)