Intersection reporting on two collections of disjoint sets (Q1818976): Difference between revisions

@@ Property / cites work @@
+On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Truly concurrent constraint programming
@@ Property / cites work: Truly concurrent constraint programming / rank @@
+Normal rank
@@ Property / cites work @@
+A class of algorithms which require nonlinear time to maintain disjoint sets
+Normal rank
@@ Property / cites work @@
+Worst-case Analysis of Set Union Algorithms
@@ Property / cites work: Worst-case Analysis of Set Union Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for manipulating priority queues
@@ Property / cites work: A data structure for manipulating priority queues / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0255(99)80001-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2058834578
@@ Property / OpenAlex ID: W2058834578 / rank @@
+Normal rank