Simplifying Flow Networks
Maximum flow problems appear in many practical applications. In this paper, we study how to simplify a given directed flow network by finding edges that can be removed without changing the value of the maximum flow. We give a number of approaches which are increasingly more complex and more time-consuming, but in exchange they remove more and more edges from the network.
KeywordsPlanar Graph Jordan Curve Interval Tree Planar Network Outgoing Edge
Unable to display preview. Download preview PDF.
- 1.Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.Google Scholar
- 2.Therese Biedl, Broňa Brejová, and Tomáš Vinař. Simplifying flow networks. Technical Report CS-2000-07, Department of Computer Science, University of Waterloo, 2000.Google Scholar
- 3.Steven Fortune, John Hopcroft, and James Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111–121, February 1980.Google Scholar
- 4.Donald B. Johnson and Shankar M. Venkatesan. Using divide and conquer to find flows in directed planar networks in O(n3/2 log n) time. In Proceedings of the 20th Annual Allerton Conference on Communication, Control, and Computing, pages 898–905, University of Illinois, Urbana-Champaign, 1982.Google Scholar
- 5.Samir Khuller, Joseph Naor, and Philip Klein. The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics, 6(3):477–490, August 1993.Google Scholar
- 6.Franco P. Preparata and Micheal I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.Google Scholar
- 7.Alexander Schrijver. Finding k disjoint paths in a directed planar graph. SIAM Journal of Computing, 23(4):780–788, August 1994.Google Scholar
- 8.Daniel D. Sleator and Robert E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362–391, June 1983.Google Scholar
- 9.Karsten Weihe. Maximum (s, t)-flows in planar networks in O(¦V¦ log ¦V¦) time. Journal of Computer and System Sciences, 55(3):454–475, December 1997.Google Scholar