Multiterminal network flow and connectivity in unsymmetrical networks

  • C. P. Schnorr
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)


Let Fu,v be the maximal flow from u to v in a network
=(V,E,c). We construct the matrix (min{Fu,v,Fv,u}|u,vεV) by solving |V| log 2|V| individual max-flow problems for
. There is a tree network
=(V,\(\bar E,\bar c\)) that stores minimal cuts corresponding to min{Fu,v,Fv,u} for all u,v.
can be constructed by solving |V| log 2|V| individual max flow problems for the given network which can be done within O(|V|4) steps using the Dinic-Karzanov algorithm. We design an algorithm that computes the edge connectivity k of a directed graph within (k|E| |V|) steps.


Maximal Flow Tree Network Minimal Capacity Edge Connectivity Weak Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E.A. Dinic, Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 11, (1970), 1277–1280Google Scholar
  2. [2]
    S. Even and R.E. Tarjan, Network flow and testing graph connectivity. Siam J. Comp. 4 (1975) 507–518CrossRefGoogle Scholar
  3. [3]
    L.R. Ford and D.R. Fulkerson, Flows in networks. Princeton University Press: Princeton, N.J. 1962Google Scholar
  4. [4]
    R.E. Gomory and T.C. Hu, Multi-terminal network flows. J. SIAM. 19, (1961) 551–570Google Scholar
  5. [5]
    A.V. Karzanov, Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15, (1974), 434–437Google Scholar
  6. [6]
    D.J. Kleitman, Methods for investigating connectivity of large graphs. IEEE Trans. Circuit Theory. CT-16, (1969) 232–233Google Scholar
  7. [7]
    C.P. Schnorr, Rekursive Funktionen und ihre Komplexität. Teubner: Stuttgart 1974Google Scholar
  8. [8]
    A. Schönhage, Universelle Turingspeicherung. In: Automatentheorie und formale Sprachen. Eds. Dörr, Hotz. Bibliographisches Institut: Mannheim 1970Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • C. P. Schnorr
    • 1
  1. 1.Fachbereich MathematikUniversität FrankfurtGermany

Personalised recommendations