Abstract
We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in an undirected planar EVC-network to the minimum edge-cut problem in another planar network with edge capacity only (EC-network), thus the minimum-cut or the maximum flow value can be computed in O(nlogn) time. Based on this reduction, in this paper we devise an O(nlogn) time algorithm for computing the maximum flow in an undirected general planar EVC-network and an O(n) time algorithm for computing the maximum flow in an undirected (s,t)-planar EVC-network. As a result, the maximum flow problem in undirected planar EVC-networks is as easy as the problem in undirected planar EC-networks in terms of computational complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahujia, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, New Jersey (1993)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, North-Holland (1976)
Borradaile, G., Klein, P.: An O(nlogn) Algorithm for Maximum s-t Flow in a Directed Planar Graph. In: Proceedings of the 17th Annual ACM-SIAM Symopsimum on Discrete Algorithms (SODA 2006), pp. 524–533 (2006)
Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum Flow Problem. Journal of the ACM 35, 921–940 (1988)
Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. Journal of the ACM 45, 783–797 (1998)
Han, Y.: Deterministic Sorting in O(nloglogn) Time and Linear Space. Journal of Algorithms 50, 96–105 (2004)
Hassin, R.: Maximum Flows in (s,t) Planar Networks. Information Processing Letters 13, 107 (1981)
Hassin, R., Johnson, D.S.: An O(nlog2 n) Algorithm for Maximum Flow in Undirected Planar Networks. SIAM Journal on Computing 14, 612–624 (1985)
Hu, T.C.: Integer Programing and Network Flows. Addison-Wesley, Reading (1969)
Khuler, S., Naor, J.: Flow in Planar Graphs with Vertex Capacities. Algoirthmica 11, 200–225 (1994)
Klein, P., Rao, S.B., Rauch-Henzinger, M., Subramanian, S.: Faster Shortest-Path Algorithms for Planar Graphs. Journal of Computer and System Science 55, 3–23 (1997)
Reif, J.H.: Minimum s − t Cut of a Planar Undirected Network in O(nlog2 n) Time. SIAM Journal on Computing 12, 71–81 (1983)
Sleator, D.D., Tarjan, R.E.: A Data Structure for Dynamic Tree. Journal of Computer and System Science 26, 362–391 (1983)
Zhang, X., Liang, W., Jiang, H.: Flow Equivalent Trees in Node-Edge-Capacitied Undirected Planar Graphs. Information Processing Letters 100, 100–115 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Liang, W., Chen, G. (2008). Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)