Maximum flow in directed planar graphs with vertex capacities

Algorithmica (New York)

Volumn 61, Issue 1, 2011, Pages 174-189

  Kaplan, Haim ^a   Nussbaum, Yahav ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Acyclic flow; Maximum flow; Planar graph; Vertex capacities; Vertex disjoint paths

Indexed keywords

ACYCLIC FLOW; MAXIMUM FLOWS; PLANAR GRAPH; VERTEX CAPACITIES; VERTEX DISJOINT PATHS;

CLUSTERING ALGORITHMS; GRAPHIC METHODS;

GRAPH THEORY;

EID: 79959217428     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-010-9436-7     Document Type: Conference Paper

References (18)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
2. G. Borradaile P. Klein 2009 An O(nlog n) algorithm for maximum st-flow in a directed planar graph J. ACM 56 1 30 2535882
3. U. Brandes D. Wagner 2000 A linear time algorithm for the arc disjoint Menger problem in planar directed graphs Algorithmica 28 16 36 1776236 0959.68097 10.1007/s004530010029
4. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
5. R. Hassin 1981 Maximum flow in (s,t) planar networks Inf. Process. Lett. 13 107 645454 10.1016/0020-0190(81)90120-4
6. 2 n) algorithm for maximum flow in undirected planar networks SIAM J. Comput. 14 612 624 795934 0565.90018 10.1137/0214045 (Pubitemid 16461000)
7. M.R. Henzinger P. Klein S. Rao S. Subramania 1997 Faster shortest-path algorithms for planar graphs J. Comput. Syst. Sci. 55 3 23 0880.68099 10.1006/jcss.1997.1493 (Pubitemid 127433390)
8. A. Itai Y. Shiloach 1979 Maximum flow in planar networks SIAM J. Comput. 8 135 150 529586 0419.90040 10.1137/0208012
9. D.B. Johnson 1987 Parallel algorithms for minimum cuts and maximum flows in planar networks J. ACM 34 950 967 10.1145/31846.31849 (Pubitemid 18521044)
10. S. Khuller J. Naor 1994 Flow in planar graphs with vertex capacities Algorithmica 11 200 225 1264676 0794.68114 10.1007/BF01240733
11. S. Khuller J. Naor P. Klein 1993 The lattice structure of flow in planar graphs SIAM J. Discrete Math. 63 477 490 1229700 10.1137/0406038
12. Nishizwki, T., Chiba, N.: Planar Graphs: Theory and Algorithms. Ann. Discrete Math., vol. 32. North-Holland, Amsterdam (1988)
13. H. Ripphausen-Lipa D. Wagner K. Weihe 1997 The vertex-disjoint Menger problem in planar graphs SIAM J. Comput. 26 331 349 1438519 0869.05059 10.1137/S0097539793253565 (Pubitemid 127652068)
14. D.D. Sleator R.E. Tarjan 1983 A data structure for dynamic trees J. Comput. Syst. Sci. 26 362 391 710253 0509.68058 10.1016/0022-0000(83)90006-5 (Pubitemid 13589150)
15. K. Weihe 1997 Edge-disjoint (s,t)-paths in undirected planar graphs in linear time J. Algorithms 23 121 138 1437724 0866.68074 10.1006/jagm.1996.0831 (Pubitemid 127451243)
16. K. Weihe 1997 Maximum (s,t)-flows in planar networks in O(|V|log |V|)-time J. Comput. Syst. Sci. 55 454 476 1607824 0897.68074 10.1006/jcss.1997.1538
17. X. Zhang W. Liang H. Jiang 2006 Flow equivalent trees in node-edge-capacitated undirected planar graphs Inf. Process. Lett. 100 100 115 2254201 10.1016/j.ipl.2006.06.001 (Pubitemid 44223482)
18. Zhang, X., Liang, W., Chen, G.: Computing maximum flows in undirected planar networks with both edge and vertex capacities. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 577-586. Springer, Heidelberg (2008)