Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time
From MaRDI portal
Publication:5199274
DOI10.1007/978-3-642-22300-6_48zbMath1342.05184WikidataQ60143022 ScholiaQ60143022MaRDI QIDQ5199274
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
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C21: Flows in graphs
Related Items
Unnamed Item, A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks, Entropic uniform sampling of linear extensions in series-parallel posets