DocumentCode :
2722708
Title :
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
Author :
Borradaile, Glencora ; Klein, Philip N. ; Mozes, Shay ; Nussbaum, Yahav ; Wulff-Nilsen, Christian
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Oregon State Univ., Corvallis, OR, USA
fYear :
2011
fDate :
22-25 Oct. 2011
Firstpage :
170
Lastpage :
179
Abstract :
We give an O(n log3 n) algorithm that, given an n-node directed planar graph with arc capacities, a set of source nodes, and a set of sink nodes, finds a maximum flow from the sources to the sinks. Previously, the fastest algorithms known for this problem were those for general graphs.
Keywords :
computational complexity; directed graphs; optimisation; 0(nlog3 n) algorithm; directed planar graphs; multiple-source multiple-sink maximum flow; Computer science; Computer vision; Data structures; Educational institutions; Face; Particle separators; Vectors; maximum ï‚ ow; planar duality; planar graph; planar separator; pseudoï‚ ow;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on
Conference_Location :
Palm Springs, CA
ISSN :
0272-5428
Print_ISBN :
978-1-4577-1843-4
Type :
conf
DOI :
10.1109/FOCS.2011.73
Filename :
6108162
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2722708
بازگشت