Critical arcs detection in influence networks

DOI10.1002/NET.21761MaRDI QIDQ4584871zbMATH OpenOpenAlexFDO

Authors Colin Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao

Publication date 4 September 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21761

zbMATH Keywords

mixed-integer programmingcritical elements detectioninfluence networks

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Recommendations

• Least cost influence propagation in (social) networks
• Selected topics in critical element detection
• Optimal detection of critical nodes: improvements to model structure and performance
• Maximizing social influence in nearly optimal time
• scientific article; zbMATH DE number 6474901

Cited in

(5)

• Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
• Fortification Against Cascade Propagation Under Uncertainty
• Modeling the spread of infectious diseases through influence maximization
• Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks
• An Application of Arc-Reaching Sets in Social-Network Analysis

This page was built for publication: Critical arcs detection in influence networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584871)