Finding the n Most Vital Nodes in a Flow Network

DOI10.1287/MNSC.21.3.362MaRDI QIDQ4077761zbMATH OpenOpenAlexFDO

Authors H. W. Corley, Han Chang

Publication date 1974

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.21.3.362

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(13)

• Most vital links and nodes in weighted networks
• A note on linearized reformulations for a class of bilevel linear integer problems
• Convex hull representation of the deterministic bipartite network interdiction problem
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm
• Sequential Shortest Path Interdiction with Incomplete Information
• Evader interdiction: algorithms, complexity and collateral damage
• On the independent set interdiction problem
• Mitigating interdiction risk with fortification
• The stochastic critical node problem over trees
• The all-pairs vitality-maximization (VIMAX) problem
• The Maximal covering location disruption problem
• Performances and correlations of centrality measures in complex networks
• Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

This page was built for publication: Finding the n Most Vital Nodes in a Flow Network

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