The following pages link to (Q4607911):
Displaying 6 items.
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- (Q5002738) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- (Q5088980) (← 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)