Cargando…
Identifying important nodes in complex networks based on extended degree and E-shell hierarchy decomposition
The identification of important nodes is a hot topic in complex networks. Many methods have been proposed in different fields for solving this problem. Most previous work emphasized the role of a single feature and, as a result, rarely made full use of multiple items. This paper proposes a new metho...
Autores principales: | Liu, Jun, Zheng, Jiming |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9950367/ https://www.ncbi.nlm.nih.gov/pubmed/36823254 http://dx.doi.org/10.1038/s41598-023-30308-5 |
Ejemplares similares
-
Parameterized complexity in the polynomial hierarchy: extending parameterized complexity theory to higher levels of the hierarchy
por: de Haan, Ronald
Publicado: (2019) -
Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy
por: Yu, Yong, et al.
Publicado: (2022) -
Estimating degree–degree correlation and network cores from the connectivity of high–degree nodes in complex networks
por: Mondragón, R. J.
Publicado: (2020) -
Hierarchy Measure for Complex Networks
por: Mones, Enys, et al.
Publicado: (2012) -
Routes Obey Hierarchy in Complex Networks
por: Csoma, Attila, et al.
Publicado: (2017)