Pages that link to "Item:Q3474282"
From MaRDI portal
The following pages link to Lower Bounds for the Stable Marriage Problem and Its Variants (Q3474282):
Displaying 15 items.
- Stable marriage with covering constraints -- a complete computational trichotomy (Q681890) (← links)
- The complexity of the certification of properties of stable marriage (Q834962) (← links)
- Two algorithms for the student-project allocation problem (Q924544) (← links)
- Efficient algorithms for generalized stable marriage and roommates problems (Q995571) (← links)
- Comment on ''worst-case choice for the stable marriage problem'' (Q1086592) (← links)
- Stable marriage and indifference (Q1317047) (← links)
- The stable marriage problem with restricted pairs. (Q1426462) (← links)
- An efficient algorithm for batch stability testing (Q1959725) (← links)
- A stable marriage requires communication (Q2278950) (← links)
- The stable fixtures problem -- a many-to-many extension of stable roommates (Q2384396) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- On the stable \(b\)-matching problem in multigraphs (Q2476254) (← links)
- Lazy Gale-Shapley for many-to-one matching with partial information (Q2695460) (← links)
- A formal theory for the complexity class associated with the stable marriage problem (Q2915696) (← links)
- Of Stable Marriages and Graphs, and Strategy and Polytopes (Q4376202) (← links)