A characterization of graphs that ensure the existence of stable matchings (Q1181746): Difference between revisions

@@ Property / author @@
-Hernán G. Abeledo
@@ Property / author: Hernán G. Abeledo / rank @@
-Normal rank
@@ Property / author @@
+Hernán G. Abeledo
@@ Property / author: Hernán G. Abeledo / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0165-4896(91)90069-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2038401741
@@ Property / OpenAlex ID: W2038401741 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonexistence of stable threesome matchings
@@ Property / cites work: Nonexistence of stable threesome matchings / rank @@
+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 @@
+Q3995616
@@ Property / cites work: Q3995616 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the “stable roommates” problem
+Normal rank
@@ Property / cites work @@
+Q4130997
@@ Property / cites work: Q4130997 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273943
@@ Property / cites work: Q4273943 / rank @@
+Normal rank