Determining the Most Vital Link in a Flow Network

Abstract

The most vital link in a single commodity flow network is that arc whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an arc to be the most vital link is established and is employed to decrease the number of arcs which must be considered.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1971
Accession Number
AD0717574

Entities

People

  • Guy T. Scilia
  • Stephen H. Lubore

Organizations

  • MITRE Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Commodities
  • Computations
  • Flow Network
  • Logistics
  • Network Science
  • Operations Research

Readers

  • Cybersecurity.
  • Fluid Dynamics.
  • Graph Algorithms and Convex Optimization.