Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties

DOI10.1016/J.JDA.2008.01.001zbMath1160.90553OpenAlexW2015939796MaRDI QIDQ1018085

Ashok Subramanian, Nitin

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

zbMATH Keywords

stabilitytiesinterconnection networksstable marriage problemunstabilitypath-lengthstable matching problempreference listsmulti-stage interconnection networksoptimal pairs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Discrete location and assignment (90B80)

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

This page was built for publication: Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties