Vulnerability of complex networks under intentional attack with incomplete information
From MaRDI portal
Recommendations
- Tolerance of local information-based intentional attacks in complex networks
- Effective measurement of network vulnerability under random and intentional attacks
- On imperfect node protection in complex communication networks
- Vulnerability of complex networks under three-level-tree attacks
- Generalized \(k\)-cores of networks under attack with limited knowledge
Cited in
(32)- Optimal attack strategy of complex networks based on tabu search
- Vulnerability of complex networks under three-level-tree attacks
- Underestimated cost of targeted attacks on complex networks
- False positive and false negative effects on network attacks
- Damage attack on complex networks
- Optimization of cascading failure on complex network based on NNIA
- Efficient disintegration strategy in directed networks based on tabu search
- Efficient network disruption under imperfect information: the sharpening effect of network reconstruction with no prior knowledge
- Generalized \(k\)-cores of networks under attack with limited knowledge
- Attack and defense strategies in complex networks based on game theory
- Some bounds for total communicability of graphs
- Efficient algorithms for estimating loss of information in a complex network: applications to intentional risk analysis
- Structural vulnerability and robustness in complex networks: different approaches and relationships between them
- Robustness of random graphs based on graph spectra
- Reducing the vulnerability of network by inserting modular topologies
- Structural robustness of combat networks of weapon system-of-systems based on the operation loop
- An attack strategy of complex networks based on average path coverage
- Network resilience against intelligent attacks constrained by the degree-dependent node removal cost
- On imperfect node protection in complex communication networks
- Robustness of regular ring lattices based on natural connectivity
- Go-index: applying supply networks principles as Internet robustness metrics
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- Accounting for the role of long walks on networks via a new matrix function
- scientific article; zbMATH DE number 5051613 (Why is no real title available?)
- Tolerance of local information-based intentional attacks in complex networks
- Cascading failures in interdependent directed networks under localized attacks
- Acquaintance immunization with limited knowledge of network structure
- Network resilience of non-hub nodes failure under memory and non-memory based attacks with limited information
- The all-pairs vitality-maximization (VIMAX) problem
- Vulnerability of complex networks
- Multi-node attack strategy of complex networks due to cascading breakdown
- Effective measurement of network vulnerability under random and intentional attacks
This page was built for publication: Vulnerability of complex networks under intentional attack with incomplete information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3435132)
