The following pages link to Optimal popular matchings (Q967372):
Displaying 18 items.
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- Bounded unpopularity matchings (Q644804) (← links)
- Popular matchings in the weighted capacitated house allocation problem (Q972348) (← links)
- Rank-maximal matchings -- structure and algorithms (Q1733053) (← links)
- Popularity at minimum cost (Q2015798) (← links)
- Finding popular branchings in vertex-weighted digraphs (Q2154110) (← links)
- Minimal envy and popular matchings (Q2242327) (← links)
- Popular and clan-popular \(b\)-matchings (Q2250455) (← links)
- Finding popular branchings in vertex-weighted directed graphs (Q2693638) (← links)
- The Generalized Popular Condensation Problem (Q2942664) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q3448799) (← links)
- Finding and Recognizing Popular Coalition Structures (Q5094026) (← links)
- Popular Matchings: Structure and Algorithms (Q5323098) (← links)
- Popular Matchings with Ties and Matroid Constraints (Q5351863) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q5371030) (← links)
- POPULAR SPANNING TREES (Q5404516) (← links)
- (Q5743383) (← links)
- Finding strongly popular \(b\)-matchings in bipartite graphs (Q5918874) (← links)
