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

DOI10.1016/J.JDA.2008.01.001MaRDI QIDQ1018085zbMATH OpenOpenAlexFDO

Authors Nitin, Ashok Subramanian

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)

Recommendations

• A New Approach to Stable Matching Problems
• An efficient algorithm for the “stable roommates” problem
• scientific article; zbMATH DE number 4133845
• Faster algorithms for stable allocation problems
• scientific article; zbMATH DE number 45086

Cites work

• scientific article; zbMATH DE number 4027472 (Why is no real title available?)
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• A New Approach to Stable Matching Problems
• A new fixed point approach for stable networks and stable marriages
• A parallel algorithm to solve the stable marriage problem
• Access and Alignment of Data in an Array Processor
• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage
• Three Fast Algorithms for Four Problems in Stable Marriage

Cited in

(1)

• Replicated multistage interconnection networks: QoS evaluation for parallel and distributed computing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018085)