Identifying critical nodes in complex networks based on multi-scale centrality algorithm
From MaRDI portal
Recommendations
- Vital nodes identification by the hybrid K-shell method based on vertex strength
- A new method for identifying influential nodes and important edges in complex networks
- Critical node identification for complex network based on a novel minimum connected dominating set
- Identifying influential nodes in complex networks from global perspective
- Critical network node evaluation based on \(m\)-order neighbor nodes
Cited in
(9)- Critical node identification for complex network based on a novel minimum connected dominating set
- Identifying vital nodes in hypernetwork based on local centrality
- Exact identification of critical nodes in sparse networks via new compact formulations
- An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks
- Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools
- Important node detection algorithm for multiple relationships online social network based on multi-subnet composited complex network model
- A fast approach to the detection of all-purpose hubs in complex networks with chemical applications
- V-E algorithm: a new vital vertex identifying algorithm based on vertex-edge interaction
- Vital nodes identification by the hybrid K-shell method based on vertex strength
This page was built for publication: Identifying critical nodes in complex networks based on multi-scale centrality algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143793)
