Pages that link to "Item:Q4973052"
From MaRDI portal
The following pages link to A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs (Q4973052):
Displaying 3 items.
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates (Q5174455) (← links)
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs (Q5236217) (← links)