An efficient algorithm for batch stability testing (Q1959725): Difference between revisions

@@ 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.1007/s00453-009-9320-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1994326691
@@ Property / OpenAlex ID: W1994326691 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+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 @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the “stable roommates” problem
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Stable Marriages
@@ Property / cites work: The Complexity of Counting Stable Marriages / rank @@
+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 @@
+Lower Bounds for the Stable Marriage Problem and Its Variants
+Normal rank
@@ Property / cites work @@
+Near-optimal fully-dynamic graph connectivity
@@ Property / cites work: Near-optimal fully-dynamic graph connectivity / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1959725