Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
From MaRDI portal
Publication:1018085
DOI10.1016/j.jda.2008.01.001zbMath1160.90553MaRDI QIDQ1018085
Publication date: 13 May 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.01.001
stability; ties; interconnection networks; stable marriage problem; unstability; path-length; stable matching problem; preference lists; multi-stage interconnection networks; optimal pairs
90C35: Programming involving graphs or networks
90C39: Dynamic programming
90B80: Discrete location and assignment
Cites Work
- Unnamed Item
- Unnamed Item
- A parallel algorithm to solve the stable marriage problem
- A new fixed point approach for stable networks and stable marriages
- An efficient algorithm for the “stable roommates” problem
- Three Fast Algorithms for Four Problems in Stable Marriage
- Access and Alignment of Data in an Array Processor
- A New Approach to Stable Matching Problems
- College Admissions and the Stability of Marriage