Influential node detection of social networks based on network invulnerability
From MaRDI portal
Publication:2212967
Recommendations
- A new metric to quantify influence of nodes in social networks
- Identifying influential nodes in complex networks from global perspective
- A new method for identifying influential nodes and important edges in complex networks
- A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
- Identifying influential nodes based on fuzzy local dimension in complex networks
Cites work
- A Non-Parametric Test of Independence
- A novel method to evaluate node importance in complex networks
- Detecting critical nodes in sparse graphs
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Identifying influential nodes in complex networks from global perspective
- Identifying influential spreaders in complex networks based on improved k-shell method
- PageRank centrality for temporal networks
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- What's in a crowd? Analysis of face-to-face behavioral networks
Cited in
(3)
This page was built for publication: Influential node detection of social networks based on network invulnerability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212967)