Pages that link to "Item:Q2946048"
From MaRDI portal
The following pages link to Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048):
Displaying 11 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Solving (large scale) matching problems combinatorially (Q750322) (← links)
- The uniquely solvable bipartite matching problem (Q1178733) (← links)
- (Q3007864) (← links)
- (Q3806971) (← links)
- (Q4350040) (← links)
- An extendable stable matching algorithm of a kind of bipartite graph (Q5069846) (← links)
- (Q5202835) (← links)
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs (Q5236217) (← links)
- Semi-matchings for bipartite graphs and load balancing (Q5491460) (← links)
- Finding strongly popular \(b\)-matchings in bipartite graphs (Q5915825) (← links)