Answers are grounded in this paper and cite their sources.
The n most vital nodes in a network are those n nodes whose removal, along with all arcs incident with them, would cause the greatest decrease in maximum flow between a specified node pair. Results are established for this problem that lead to a procedure for determining the n most vital nodes.
No takes yet. Share an insight, caveat, or question.
Corley et al. (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: