Computing maximum flows in undirected planar networks with both edge and vertex capacities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5092 LNCS, Issue , 2008, Pages 577-586

  Zhang, Xianchao ^a   Liang, Weifa ^b   Chen, Guoliang ^c  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY; ELECTRIC CONDUCTIVITY MEASUREMENT;

COMBINATORICS; EDGE CUTS; INTERNATIONAL CONFERENCES; MAXIMUM FLOWS; MINIMUM CUTS; PLANAR NETWORKS;

BLOOD VESSEL PROSTHESES;

EID: 48249099630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69733-6_57     Document Type: Conference Paper

References (14)

1. Ahujia, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications, Prentice-Hall, New Jersey (1993)
2. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, North-Holland (1976)
3. Borradaile, G., Klein, P.: An O(n log n) 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)
4. Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum Flow Problem. Journal of the ACM 35, 921-940 (1988)
5. Goldberg, A.V., Rao, S.: Beyond the Flow Decomposition Barrier. Journal of the ACM 45, 783-797 (1998)
6. Han, Y.: Deterministic Sorting in O(n log log n) Time and Linear Space. Journal of Algorithms 50, 96-105 (2004)
7. Hassin, R.: Maximum Flows in (s, t) Planar Networks. Information Processing Letters 13, 107 (1981)
8. 2 n) Algorithm for Maximum Flow in Undirected Planar Networks. SIAM Journal on Computing 14, 612-624 (1985)
9. Hu, T.C.: Integer Programing and Network Flows. Addison-Wesley, Reading (1969)
10. Khuler, S., Naor, J.: Flow in Planar Graphs with Vertex Capacities. Algoirthmica 11, 200-225 (1994)
11. 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)
12. 2 n) Time. SIAM Journal on Computing 12, 71-81 (1983)
13. Sleator, D.D., Tarjan, R.E.: A Data Structure for Dynamic Tree. Journal of Computer and System Science 26, 362-391 (1983)
14. Zhang, X., Liang, W., Jiang, H.: Flow Equivalent Trees in Node-Edge-Capacitied Undirected Planar Graphs. Information Processing Letters 100, 100-115 (2006)