Pages that link to "Item:Q1951580"
From MaRDI portal
The following pages link to Popular matchings in the stable marriage problem (Q1951580):
Displayed 20 items.
- A social choice approach to ordinal group activity selection (Q1642162) (← links)
- Application of pair approximation method to modeling and analysis of a marriage network (Q1734321) (← links)
- PROM: efficient matching query processing on high-dimensional data (Q1750027) (← links)
- Popular edges and dominant matchings (Q1800997) (← links)
- (Un)stable matchings with blocking costs (Q2060342) (← links)
- Popular branchings and their dual certificates (Q2118146) (← links)
- Popular matchings with two-sided preference lists and matroid constraints (Q2290635) (← links)
- Two problems in max-size popular matchings (Q2415362) (← links)
- Popular matchings in complete graphs (Q2663715) (← links)
- Finding popular branchings in vertex-weighted directed graphs (Q2693638) (← links)
- The Generalized Popular Condensation Problem (Q2942664) (← links)
- Popularity, Mixed Matchings, and Self-Duality (Q5000640) (← links)
- Understanding Popular Matchings via Stable Matchings (Q5028352) (← links)
- Popular Branchings and Their Dual Certificates (Q5041748) (← links)
- Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
- (Q5136309) (← links)
- Popular Matchings with Lower Quotas (Q5136336) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q5371030) (← links)
- Finding strongly popular \(b\)-matchings in bipartite graphs (Q5915825) (← links)
- Popular critical matchings in the many-to-many setting (Q6199405) (← links)