Multiple-source single-sink maximum flow in directed planar graphs in O(diameter n n) time
From MaRDI portal
Publication:5199274
Recommendations
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- Maximum integer flows in directed planar graphs with vertex capacities and multiple sources and sinks
- Maximum flow in directed planar graphs with vertex capacities
- An O(n n) algorithm for maximum st-flow in a directed planar graph
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
Cited in
(11)- A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
- Entropic uniform sampling of linear extensions in series-parallel posets
- Flow in Planar Graphs with Multiple Sources and Sinks
- Decremental SPQR-trees for Planar Graphs
- Contracting a planar graph efficiently
- Maximum integer flows in directed planar graphs with vertex capacities and multiple sources and sinks
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Minimum cut in \(O(m \log^2 n)\) time
This page was built for publication: Multiple-source single-sink maximum flow in directed planar graphs in \(O(\mathrm{diameter} \cdot n \log n)\) time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199274)
