Measuring the impact of MVC attack in large complex networks
From MaRDI portal
Publication:506775
DOI10.1016/j.ins.2014.03.085zbMath1354.05125OpenAlexW2137313157MaRDI QIDQ506775
Rong-Hua 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
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
\(k\)-metric antidimension: a privacy measure for social graphs ⋮ An efficient local search framework for the minimum weighted vertex cover problem ⋮ Level-aware collective spatial keyword queries
Uses Software
Cites Work
- Hyper Hamiltonian laceability on edge fault star graph
- Improving bounds on link failure tolerance of the star graph
- Probabilistic counting algorithms for data base applications
- On approximation of max-vertex-cover
- Robustness of fuzzy reasoning via logically equivalence measure
- Robustness of star graph network under link failure
- Isoperimetric numbers of graphs
- An approach to measure the robustness of fuzzy reasoning
- Emergence of Scaling in Random Networks
- Multiscale vulnerability of complex networks
- Conditional connectivity
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
- An analysis of approximations for maximizing submodular set functions—I
- Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
- Collective dynamics of ‘small-world’ networks
- Algorithms - ESA 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
