Circulations, Fuzzy Relations and Semirings
Circulations are similar to flows in capacity-constrained networks, with the difference that they also observe lower bounds and, unlike flows, are not directed from a source to a sink. We give a new description of circulations in networks using a technique introduced by Kawahara; he applied the same methods to network flows. We show the power and flexibility of his approach in a new application, refining it at the same time by introducing the concept of test relations. Furthermore we will give algebraic formulations of a generic algorithm for computing a flow in a network with lower bounds and a sufficient and necessary criterion for the existence of a circulation.
Unable to display preview. Download preview PDF.
- [AMO]Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
- [Glü]Glück, R.: Network Flows, Semirings and Fuzzy Relations. Institut für Informatik, Universität Augsburg, Tech. Rep, -01 (2008), http://www.opus-bayern.de/uni-augsburg/volltexte/2008/726/
- [GlüI]Glück, R.: Import Networks, Fuzzy Relations and Semirings. In: Berghammer, R., Möller, B., Struth, G. (eds.) Relations and Kleene Algebra in Computer Science — PhD Programme Proceedings, RelMiCS10/AKA5, Frauenwörth, Germany, April 7 – April 11, 2008. Institut für Informatik, Universität Augsburg, Technical Report 2008-04, pp. 58–62 (2008)Google Scholar
- [GTT]Goldberg, A., Tardos, E., Tarjan, R.: Network Flow Algorithms. In: Korte, B., Lovasz, L., Prömel, H., Schrijver, A. (eds.) Algorithms and Combinatorics. Paths, Rows, and VLSI-Layout, vol. 9, pp. 101–164. Springer, Heidelberg (1990)Google Scholar