Measuring the impact of MVC attack in large complex networks
From MaRDI portal
Publication:506775
DOI10.1016/J.INS.2014.03.085zbMATH Open1354.05125OpenAlexW2137313157MaRDI QIDQ506775FDOQ506775
Authors: Ronghua Li, Jeffrey Xu Yu, Hong Cheng, Zechao Shang, Xin Huang 
Publication date: 2 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.03.085
Recommendations
- Measuring the robustness of a network using minimal vertex covers
- Effective measurement of network vulnerability under random and intentional attacks
- Optimal serverless networks attacks, complexity and some approximate algorithms
- Damage attack on complex networks
- An attack strategy of complex networks based on average path coverage
Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Title not available (Why is that?)
- Emergence of Scaling in Random Networks
- Collective dynamics of `small-world' networks
- Title not available (Why is that?)
- Isoperimetric numbers of graphs
- Conditional connectivity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hyper Hamiltonian laceability on edge fault star graph
- An analysis of approximations for maximizing submodular set functions—I
- Title not available (Why is that?)
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Probabilistic counting algorithms for data base applications
- On approximation of max-vertex-cover
- Robustness of fuzzy reasoning via logically equivalence measure
- An approach to measure the robustness of fuzzy reasoning
- Robustness of star graph network under link failure
- Improving bounds on link failure tolerance of the star graph
- LogLog counting of large cardinalities (extended abstract)
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Multiscale vulnerability of complex networks
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
- Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
Cited In (5)
- \(k\)-metric antidimension: a privacy measure for social graphs
- An efficient local search framework for the minimum weighted vertex cover problem
- Underestimated cost of targeted attacks on complex networks
- Level-aware collective spatial keyword queries
- Measuring the robustness of a network using minimal vertex covers
Uses Software
This page was built for publication: Measuring the impact of MVC attack in large complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506775)
