Finding the n Most Vital Nodes in a Flow Network

H. W. Corley, Jr. and Han Chang
Additional contact information
H. W. Corley, Jr.: The University of Texas at Arlington
Han Chang: The University of Texas at Arlington

Management Science, 1974, vol. 21, issue 3, 362-364

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.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.3.362 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:21:y:1974:i:3:p:362-364

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().