Finding Critical Links for Closeness Centrality

DOI10.1287/ijoc.2018.0829zbMath1448.90032OpenAlexW2942747511MaRDI QIDQ5138269

Oleg A. Prokopyev, Eduardo L. Pasiliao, Alexander Veremyev

Publication date: 3 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/daeb5f7eaddcbee9b065f4466de7b9cc867c7b1f

zbMATH Keywords

mixed integer programmingnetwork interdictioncritical edge detectioncloseness centralitydistance-based centrality

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (5)

Fortification Against Cascade Propagation Under Uncertainty ⋮ On designing networks resilient to clique blockers ⋮ The stochastic pseudo-star degree centrality problem ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ Detecting a most closeness-central clique in complex networks

Uses Software

• Pajek
• Pajek datasets
• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Identifying sets of key players in a social network
• An integer programming framework for critical elements detection in graphs
• On Harary index
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Detecting critical nodes in sparse graphs
• On some counting polynomials in chemistry
• Eigenvalues and expanders
• The k most vital arcs in the shortest path problem
• The complexity of testing whether a graph is a superconcentrator
• Links between linear bilevel and mixed 0-1 programming problems
• The critical node detection problem in networks: a survey
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• An integer programming approach for finding the most and the least central cliques
• Exact identification of critical nodes in sparse networks via new compact formulations
• An overview of bilevel optimization
• A faster algorithm for betweenness centrality*
• The university of Florida sparse matrix collection
• Statistical mechanics of complex networks
• The centrality of groups and classes
• Community structure in social and biological networks
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
• Shortest-path network interdiction
• Axioms for Centrality
• Selected Topics in Critical Element Detection
• Collective dynamics of ‘small-world’ networks
• Networks

This page was built for publication: Finding Critical Links for Closeness Centrality