Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties (Q1018085): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2008.01.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2015939796
@@ Property / OpenAlex ID: W2015939796 / rank @@
+Normal rank
@@ Property / cites work @@
+A new fixed point approach for stable networks and stable marriages
+Normal rank
@@ Property / cites work @@
+College Admissions and the Stability of Marriage
@@ Property / cites work: College Admissions and the Stability of Marriage / rank @@
+Normal rank
@@ Property / cites work @@
+Three Fast Algorithms for Four Problems in Stable Marriage
+Normal rank
@@ Property / cites work @@
+Q3995616
@@ Property / cites work: Q3995616 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the “stable roommates” problem
+Normal rank
@@ Property / cites work @@
+Access and Alignment of Data in an Array Processor
+Normal rank
@@ Property / cites work @@
+Q3768905
@@ Property / cites work: Q3768905 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Approach to Stable Matching Problems
@@ Property / cites work: A New Approach to Stable Matching Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel algorithm to solve the stable marriage problem
+Normal rank