A parallel algorithm to solve the stable marriage problem
From MaRDI portal
Recommendations
Cites work
Cited in
(12)- On the decomposability of the stable marriage problem
- A neural network approach to solve the stable matching problem
- The average performance of a parallel stable mariage algorithm
- High Performance Computing - HiPC 2003
- Distributed Weighted Stable Marriage Problem
- Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
- Almost stable matchings by truncating the Gale-Shapley algorithm
- The necessary and sufficient condition for the worst-case male optimal stable matching
- On the invariance of male optimal stable matching
- Worst-case choice for the stable marriage problem
- On stable marriages and greedy matchings
- Stable matching with special preference patterns
This page was built for publication: A parallel algorithm to solve the stable marriage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798000)