Reduktion von Flußnetzplänen
- 181 Downloads
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 \)).
Unable to display preview. Download preview PDF.
- Kaerkes, R. Netzplantheorie, Proceedings in O.R. 3/Physica-Verlag (1973)Google Scholar
- Ford, L.R. - Fulkerson, D.R. Flews in Networks, Princeton University Press (1962)Google Scholar
- Möhring, R. Graphentheoretische Repräsentation von Ordnungen, Proceedings in O.R. 3/Physica-Verlag (1973)Google Scholar
- Radermacher, F.-J. Reduktion von Netzplänen, Proceedings in O.R. 3/Physica-Verlag (1973)Google Scholar