Computing Mazimum Flows in Undirected Planar Networks with Both Edge and Vertez Capacities

摘要：

We study the maximum flow problem in an undirected plar nar 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(n log n) time. Based on this reduction, in this paper we devise an O(n log n) 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.

作者: Xianchao Zhang Weifa Liang Guoliang Chen

作者单位: School of Software, Dalian University of Technology Dalian,China, 116620 Department of Computer Science, Australian National University Canberra, ACT 0200, Australia Department of Computer, University of Science and Technology of China Hefei, China, 230027

会议类型: 国际会议

会议名称: The 4th Annual International Computing and Combinatorics Conference,COCOON 2008(第14届国际计算和组合会议)

会议地点: 大连

会议语种:英文

页码: 577-586

在线出版日期: 2008-06-01（万方平台首次上网日期，不代表论文的发表时间）