Faster algorithms for stable allocation problems (Q1959735): Difference between revisions

@@ Property / cites work @@
+Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
+Normal rank
@@ Property / cites work @@
+Erratum: The Stable Allocation (or Ordinal Transportation) Problem
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithm for an optimal stable assignment with multiple partners
+Normal rank
@@ Property / cites work @@
+The integral stable allocation problem on graphs
@@ Property / cites work: The integral stable allocation problem on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data
+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 @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+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 @@
+Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for the existence of a complete stable matching
+Normal rank