Finding the n Most Vital Nodes in a Flow Network
Published Online:1 Nov 1974https://doi.org/10.1287/mnsc.21.3.362
Abstract
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.
