Pages that link to "Item:Q1821125"
From MaRDI portal
The following pages link to Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (Q1821125):
Displayed 9 items.
- Complexity of the sex-equal stable marriage problem (Q689901) (← links)
- A unifying approach to the structures of the stable matching problems (Q808729) (← links)
- Interior points in the core of two-sided matching markets (Q1110430) (← links)
- Linear programming brings marital bliss (Q1122480) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- An efficient algorithm for batch stability testing (Q1959725) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Faster algorithms for stable allocation problems (Q1959735) (← links)