Improving connectivity of compromised digital networks via algebraic connectivity maximisation

DOI10.1016/j.ejor.2021.01.015zbMath1487.90089OpenAlexW3118641713MaRDI QIDQ2031111

Michael G. H. Bell, Kam-Fung Cheung

Publication date: 8 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.01.015

zbMATH Keywords

heuristicsdecision analysisalgebraic connectivitycybersecurityreal-time recovery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Connectivity (05C40)

Related Items

Efficient presolving methods for the influence maximization problem, Hypergraph analysis based on a compatible tensor product structure

Uses Software

• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Matrix multiplication via arithmetic progressions
• Optimizing tabu list size for the traveling salesman problem
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Quantal response equilibria for normal form games
• Algorithms for synthesizing mechanical systems with maximal natural frequencies
• A maximum algebraic connectivity increment edge-based strategy for capacity enhancement in scale-free networks
• A survey of network interdiction models and algorithms
• Optimizing algebraic connectivity by edge rewiring
• Maximum algebraic connectivity augmentation is NP-hard
• Emergence of Scaling in Random Networks
• Tabu Search—Part I
• Tabu Search—Part II
• Sequential Interdiction with Incomplete Information and Learning