Pages that link to "Item:Q1069866"
From MaRDI portal
The following pages link to An efficient algorithm for the bipartite matching problem (Q1069866):
Displaying 17 items.
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784) (← links)
- A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
- The uniquely solvable bipartite matching problem (Q1178733) (← links)
- An efficient matching algorithm applied in statistical physics (Q1331902) (← links)
- Max-min matching problems with multiple assignments (Q1359459) (← links)
- \(n\)-Tokyoites' loop-line commuter problem (Q1402069) (← links)
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- An efficient algorithm for finding a two-pair, and its applications (Q1814097) (← links)
- A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
- An algorithm for computing the matching capacity (Q2484637) (← links)
- Extended Kuhn-Munkres algorithm for constrained matching search (Q3381017) (← links)
- (Q4452099) (← links)
- An extendable stable matching algorithm of a kind of bipartite graph (Q5069846) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs (Q5236217) (← links)