Measuring the impact of MVC attack in large complex networks

DOI10.1016/J.INS.2014.03.085MaRDI QIDQ506775zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

adaptive submodularitycomplex networkFM sketchMVC attacksubmodularity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

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

Cites work

• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• An analysis of approximations for maximizing submodular set functions—I
• An approach to measure the robustness of fuzzy reasoning
• Collective dynamics of `small-world' networks
• Conditional connectivity
• Emergence of Scaling in Random Networks
• Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 5763313 (Why is no real title available?)
• scientific article; zbMATH DE number 3735859 (Why is no real title available?)
• scientific article; zbMATH DE number 1330032 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Hyper Hamiltonian laceability on edge fault star graph
• Improving bounds on link failure tolerance of the star graph
• Isoperimetric numbers of graphs
• LogLog counting of large cardinalities (extended abstract)
• Multiscale vulnerability of complex networks
• Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
• On approximation of max-vertex-cover
• Probabilistic counting algorithms for data base applications
• Robustness of fuzzy reasoning via logically equivalence measure
• Robustness of star graph network under link failure
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem

Cited in

(5)

• Underestimated cost of targeted attacks on complex networks
• k-metric antidimension: a privacy measure for social graphs
• Measuring the robustness of a network using minimal vertex covers
• An efficient local search framework for the minimum weighted vertex cover problem
• Level-aware collective spatial keyword queries

Describes a project that uses

Uses Software

• HyperLogLog
• ANF

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)