Maximum Flow in Planar Networks
From MaRDI portal
Cited in
(23)- A note on finding minimum cuts in directed planar networks by parallel computations
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- Bounding the variance in Monte Carlo experiments
- Flow in planar graphs with vertex capacities
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- Faster shortest paths in dense distance graphs, with applications
- Allocation under a general substitution structure
- A linear-time algorithm for edge-disjoint paths in planar graphs
- Lattices and maximum flow algorithms in planar graphs
- Evaluating Reliability of Stochastic Flow Networks
- Capacity Expansion in Stochastic Flow Networks
- scientific article; zbMATH DE number 60387 (Why is no real title available?)
- Counting and sampling minimum cuts in genus g graphs
- Global minimum cuts in surface embedded graphs
- Minimum Cuts in Surface Graphs
- Level-planar drawings with few slopes
- Level-planar drawings with few slopes
- How vulnerable is an undirected planar graph with respect to max flow
- How vulnerable is an undirected planar graph with respect to max flow
- Maximum flow in directed planar graphs with vertex capacities
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time
- On maximum flows in polyhedral domains
This page was built for publication: Maximum Flow in Planar Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853414)
