A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Recommendations
- A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
- Experimental and Efficient Algorithms
- scientific article; zbMATH DE number 3965443
- NC algorithms for weighted planar perfect matching and related problems
Cited in
(8)- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
- A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
- Improved bounds for shortest paths in dense distance graphs
- Min-Cost Flow in Unit-Capacity Planar Graphs
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
- Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
This page was built for publication: A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607911)
