Analysis of complex network performance and heuristic node removal strategies
From MaRDI portal
Recommendations
- Underestimated cost of targeted attacks on complex networks
- How the science of complex networks can help developing strategies against terrorism
- Importance identification method of complex network nodes based on betweenness and degree entropy
- Critical node identification for complex network based on a novel minimum connected dominating set
- The critical node detection problem in networks: a survey
Cites work
- A faster algorithm for betweenness centrality*
- Collective dynamics of `small-world' networks
- Identifying sets of key players in a social network
- Introduction to algorithms
- Networks. An introduction.
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Social and economic networks.
- Statistical analysis of network data. Methods and models
- Vulnerability of complex networks
Cited in
(6)- Hybrid analysis of a large-scale network by node-tearing
- Research of cooperative communication network with both preferential and random attachments
- Energy disruptive centrality with an application to criminal network
- On effectiveness of wiretap programs in mapping social networks
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
This page was built for publication: Analysis of complex network performance and heuristic node removal strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312858)
