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

  title={Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)},
  author={Gary L. Miller and Joseph Naor},
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

From This Paper

Topics from this paper.
8 Citations
9 References
Similar Papers


Publications referenced by this paper.
Showing 1-9 of 9 references

C algorithms f o r computing the number of perfect niatchings i n I(3,S-jree graphs a n d related pvoblems

  • N V.V. Vazirani
  • Scandinavian Workshop on AlgorithmTheory (SWAT),
  • 1988

The m a x i m u m pow problem is log space complete f o r P

  • L. Goldschlager, R. Shaw, J. Staples
  • Theoretical Coinputer Science,
  • 1982

A good algorithm f o r lexicographically opf.imo.1 ,flows in multi-terminal terminals

  • N. Megiddo
  • Bulletin of the AMS,
  • 1977

Optimal f lows i n networks with multiple sources and sinks

  • N. Megidclo
  • Mathematical Programming,
  • 1974

Matching is u s easy as matrix inversion, Combinatorica

  • I. Mulmdey
  • 1957

Mazimal f low through a network

  • FF L.R. Ford, D. R. Fulkerson
  • Canadian Journal of Mathematics,
  • 1956

Similar Papers

Loading similar papers…