Skip navigation
Skip navigation

Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities

Zhang, Xianchao; Liang, Weifa; Chen, Guoliang

Description

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]

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
URI: http://hdl.handle.net/1885/18057
Source: Computing and Combinatorics, 14th Annual International Conference Proceedings COCOON 2008
DOI: 10.1007/978-3-540-69733-6_57

Download

File Description SizeFormat Image
01_Zhang_Computing_Maximum_Flows_in_2008.pdf117.93 kBAdobe PDF    Request a copy
02_Zhang_Computing_Maximum_Flows_in_2008.pdf478.49 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator