Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Computing and Combinatorics, 14th Annual International Conference Proceedings COCOON 2008|
|01_Zhang_Computing_Maximum_Flows_in_2008.pdf||117.93 kB||Adobe PDF||Request a copy|
|02_Zhang_Computing_Maximum_Flows_in_2008.pdf||478.49 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.