Advertisement

Reduktion von Flußnetzplänen

Conference paper
Part of the Proceedings in Operations Research book series (ORP, volume 1973)

Abstract

In the theory of “Flows in Networks”, the maximal flow can be determined by the minimal-capacity of proper disconnecting sets because of the theorem of Ford and Fulkerson. Howsver it remains difficult to locate all those sets in a great network. This is one reason to be interested in a theory, that makes it possible to determine the maximal flow by only computing appropriate sub-networks and a (reduced) homomorph image. Planning networks are an important subclass of all networks (just those, that can be described by a system Ac:= (A,O,c), Where O is an ordering in the set A and c is a “capacity” -function, c: Inline \( A \to R_ + ^4 \)).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [1]
    Kaerkes, R. Netzplantheorie, Proceedings in O.R. 3/Physica-Verlag (1973)Google Scholar
  2. [2]
    Ford, L.R. - Fulkerson, D.R. Flews in Networks, Princeton University Press (1962)Google Scholar
  3. [3]
    Möhring, R. Graphentheoretische Repräsentation von Ordnungen, Proceedings in O.R. 3/Physica-Verlag (1973)Google Scholar
  4. [4]
    Radermacher, F.-J. Reduktion von Netzplänen, Proceedings in O.R. 3/Physica-Verlag (1973)Google Scholar

Copyright information

© Physica-Verlag, Rudolf Liebing KG, Würzburg 1974

Authors and Affiliations

  1. 1.AachenDeutschland

Personalised recommendations