Min-Cost Flow in Unit-Capacity Planar Graphs

Related Items (1)

Quasi-upward planar drawings with minimum curve complexity

Uses Software

RELAX4

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A strongly polynomial minimum cost circulation algorithm
Minimum-cost flows in unit-capacity networks
Recognition of probe proper interval graphs
Planar graphs, negative weight edges, shortest paths, and near linear time
Multiple-Source Shortest Paths in Embedded Graphs
Finding Minimum-Cost Circulations by Successive Approximation
An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Network Flow and Testing Graph Connectivity
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m^10/7 log W) Time (Extended Abstract)
Faster Scaling Algorithms for Network Problems
Flow in Planar Graphs with Multiple Sources and Sinks
Decremental single-source reachability in planar digraphs
NC Algorithms for Weighted Planar Perfect Matching and Related Problems
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
Constructing Maximal Dynamic Flows from Static Flows
Improved algorithms for min cut and max flow in undirected planar graphs
Structured recursive separator decompositions for planar graphs in linear time
On some techniques useful for solution of transportation network problems
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Min-Cost Flow in Unit-Capacity Planar Graphs