Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)

@inproceedings{Miller1989FlowIP,
title={Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)},
author={Gary L. Miller and Joseph Naor},
booktitle={FOCS},
year={1989}
}

In the common forniulation of the maximum flow problem, the maximum flow from a distinguished vertex in the graph, called the source, to mother distinguished vertex in the graph, called the sink, is computed. Here we assume that the underlying network is planar; this case was extensively studied and more efficient algorithms were developed for it (see section 2). Yet the a,ssumption wa.s always that there is only one source and one sink. In this paper we investigate the following problem: given… CONTINUE READING