Identifying critical nodes in complex networks based on neighborhood information
From MaRDI portal
Publication:6559244
Recommendations
- A new method for identifying influential nodes and important edges in complex networks
- Efficient identification of node importance based on agglomeration in cycle-related networks
- Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks
- Vital nodes identification by the hybrid K-shell method based on vertex strength
- Identifying influential nodes in complex networks from global perspective
Cites work
- A k-shell decomposition method for weighted networks
- A modified weighted TOPSIS to identify influential nodes in complex networks
- A new measure of identifying influential nodes: efficiency centrality
- An index to quantify an individual's scientific research output
- Collective dynamics of `small-world' networks
- Coreness and $h$ -Index for Weighted Networks
- Emergence of Scaling in Random Networks
- Identification of influential spreaders based on classified neighbors in real-world complex networks
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying influential spreaders by weighted leaderrank
- Percolation on complex networks: theory and application
- Ranking in evolving complex networks
- Statistical mechanics of complex networks
Cited in
(2)
This page was built for publication: Identifying critical nodes in complex networks based on neighborhood information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559244)
