Minimum cuts and maximum flows in directed planar networks with both node and edge capacities

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 29, Issue 4, 2006, Pages 544-551

  Zhang, Xian Chao ^a   Jiang, He ^a,b   Chen, Guo Liang ^b  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

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

Author keywords

Maximum flow; Minimum cut; NC; P complete; Planar network

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; REDUCTION; VLSI CIRCUITS;

EDGE CAPACITIES; MAXIMUM FLOW; MINIMUM CUT; NC; O(NLOGN) TIME ALGORITHMS; P COMPLETE; PLANAR NETWORK;

NETWORKS (CIRCUITS);

EID: 33744962487     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Ahujia R. K., Magnanti T. L., Orlin J. B.. Network Flows: Theory, Algorithms and Applications. New Jersey: Rentice-Hall, 1993
2. Zhang Xian-Chao, Chen Guo-Liang, Wan Ying-Yu. Research on the maximum network flow problem. Journal of Computer Research and Development, 2003, 40(9): 1281-1292 (in Chinese)
3. Goldberg A. V., Tarjan R. E.. A new approach to the maximum flow problem. Journal of ACM, 1988, 35(4): 921-940
4. Goldberg A. V., Rao S.. Beyond the flow decomposition barrier. Journal of ACM, 1998, 45(5): 783-797
5. Johnson D. B., Venkatesan S.. Using divide and conquer to find flows in directed planar networks. In: Proceedings of the 20th Annual Allerton Conference on Communication and Computing, Monticello, IL, 1982, 898-905
6. Johnson D. B.. Parallel algorithms for minimum cuts and maximum flows in planar networks. Journal of ACM, 1987, 34(4): 950-967
7. Klein P., Rao S. B., Rauch-Henzinger M., Subramanian S.. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 1997, 55(3): 3-23
8. Weihe K.. Maximum (s, t)-flows in planar network in O(|V|log|V|) time. Journal of Computer and System Sciences, 1997, 55(3): 454-475
9. Bondy J. A., Murty U. S. R.. Graph Theory with Applications. Amsteram: North-Holland, 1977
10. Goldschlager L. M., Shaw R., Staples J.. The maximum flow problem is log space complete. Theoretical Computer Science, 1982, 21(1): 105-111
11. Zhang Xian-Chao, Wan Ying-Yu, Chen Guo-Liang. Approaches to the minimum cut problem in a class of practical networks. Journal of Software, 2003, 14(5): 885-890 (in Chinese)
12. Wang Shu-He. Graph Theory and Algorithms. Hefei: Publishing House of University of Science and Technology of China, 1994 (in Chinese)
13. Chen Guo-Liang. Design and Analysis of Parallel Algorithms. Beijing: Higher Education Press, 1994 (in Chinese)
14. Sleator D. D., Tarjan R. E.. A data structure for dynamic tree. Journal of Computer and System Sciences, 1983, 26(3): 362-391
15. Chen Guo-Liang, Liang Wei-Fa, Shen Hong. Research advances in parallel graph algorithms. Journal of Computer Research and Development, 1995, 32(9): 1-16 (in Chinese)