BibTeX
CSL-JSON
MLA
Harvard
Multiple-source multiple-sink maximum flow in planar graphs
release_w5xktpb5z5fpfhlswe7irhocuu
by
Yahav Nussbaum
Released
as a article
.
2010
Abstract
In this paper we show an O(n^(3/2) log^2 n) time algorithm for finding a
maximum flow in a planar graph with multiple sources and multiple sinks. This
is the fastest algorithm whose running time depends only on the number of
vertices in the graph. For general (non-planar) graphs the multiple-source
multiple-sink version of the maximum flow problem is as difficult as the
standard single-source single-sink version. However, the standard reduction
does not preserve the planarity of the graph, and it is not known how to
generalize existing maximum flow algorithms for planar graphs to the
multiple-source multiple-sink maximum flow problem.
In text/plain
format
Archived Files and Locations
application/pdf 153.0 kB
file_kn4wld2erbb75oj4wg2omja7ze
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1012.4767v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links