Multi-Therminal Flows in a Network.

Abstract

A newtwork consists of nodes connected by arcs. Every arc has a capacity of transmitting the flow through the arc. For a given network, there is a maximal flow between every pair of nodes acting as the source and the sink of the flow. The author considers the problems of realizability, analysis and synthesis of multi-terminal flows in the paper. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1972
Accession Number
AD0748773

Entities

People

  • T. C. Hu

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Terminals

Readers

  • Computer Networking
  • Graph Algorithms and Convex Optimization.