Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time

DOI10.1007/978-3-642-22300-6_48zbMath1342.05184OpenAlexW1570735312WikidataQ60143022 ScholiaQ60143022MaRDI QIDQ5199274

Shay Mozes, Philip N. Klein

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_48

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items

Entropic uniform sampling of linear extensions in series-parallel posets ⋮ A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Contracting a Planar Graph Efficiently ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time

This page was built for publication: Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time