Flow in Planar Graphs with Multiple Sources and Sinks
From MaRDI portal
Recommendations
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
- Algorithms for multicommodity flows in planar graphs
- An O(n\log ^2 n) Algorithm for Maximum Flow in Undirected Planar Networks
- Multiple-source single-sink maximum flow in directed planar graphs in \(O(\mathrm{diameter} \cdot n \log n)\) time
Cited in
(36)- Algorithms for multicommodity flows in planar graphs
- Source sink flows with capacity installation in batches
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Deterministically isolating a perfect matching in bipartite planar graphs
- Willmore flow of planar networks
- Processor efficient parallel matching
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Boundary-to-Boundary Flows in Planar Graphs
- Fast domino tileability
- The Lattice Structure of Flow in Planar Graphs
- scientific article; zbMATH DE number 431512 (Why is no real title available?)
- An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
- Planar Multicommodity Fows, Maximum Matchings and Negative Cycles
- Polymatroidal flow network models with multiple sinks
- Parallel Algorithms for Zero-One Supply-Demand Problems
- scientific article; zbMATH DE number 16725 (Why is no real title available?)
- Potentials in Undirected Graphs and Planar Multiflows
- Space complexity of perfect matching in bounded genus bipartite graphs
- Orthogonal graph drawing with flexibility constraints
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Bipartite perfect matching is in quasi-NC
- NC algorithms for weighted planar perfect matching and related problems
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Planar Maximum Matching: Towards a Parallel Algorithm
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
- Computing large matchings in planar graphs with fixed minimum degree
- Minimum Cuts in Surface Graphs
- Accelerated bend minimization
- Faster shortest-path algorithms for planar graphs
- Some flow-equivalent planar and non-planar graphs
- Tiling with Squares and Packing Dominos in Polynomial Time
- A topology-shape-metrics framework for ortho-radial graph drawing
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
- Duality for pairs of upward bipolar plane graphs and submodule lattices.
- Network flow interdiction on planar graphs
This page was built for publication: Flow in Planar Graphs with Multiple Sources and Sinks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857591)
