• DocumentCode
    895130
  • Title

    Maximum flow in a communication network

  • Author

    Bapeswara Rao, V.V. ; Sankara Rao, K. ; Sankaran, Praveen ; Murti, V.G.K.

  • Volume
    56
  • Issue
    1
  • fYear
    1968
  • Firstpage
    134
  • Lastpage
    135
  • Abstract
    The "max-flow min-cut" theorem is used to determine the maximum flow from vertex i to vertix j in a communication network. To generate all segregations that disconnect i and j, an algorithm based on the binary form of natural numbers is presented.
  • Keywords
    Charge carrier lifetime; Communication networks; Equations; Motion measurement; P-n junctions; Photovoltaic systems; Probes; Solar power generation; Solids; Telecommunications;
  • fLanguage
    English
  • Journal_Title
    Proceedings of the IEEE
  • Publisher
    ieee
  • ISSN
    0018-9219
  • Type

    jour

  • DOI
    10.1109/PROC.1968.6201
  • Filename
    1448131
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=895130