A note on set union with arbitrary deunions (Q751279): 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.1016/0020-0190(91)90151-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2080432589
@@ Property / OpenAlex ID: W2080432589 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of the set-union problem with extended backtracking
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3796783
@@ Property / cites work: Q3796783 / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound on the Complexity of the Union-Split-Find Problem
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+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