A data structure for dynamic trees (Q1838310): Difference between revisions

@@ Property / cites work @@
+On Finding Lowest Common Ancestors in Trees
@@ Property / cites work: On Finding Lowest Common Ancestors in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Biased Search Trees
@@ Property / cites work: Biased Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3323698
@@ Property / cites work: Q3323698 / rank @@
+Normal rank
@@ Property / cites work @@
+Programming as a Discipline of Mathematical Nature
+Normal rank
@@ Property / cites work @@
+Q5624995
@@ Property / cites work: Q5624995 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for a family of matroid intersection problems
+Normal rank
@@ Property / cites work @@
+An \(O(EV\log^2V)\) algorithm for the maximal flow problem
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Method for Storing Ancestor Information in Trees
+Normal rank
@@ Property / cites work @@
+An \(O(IVI^3)\) algorithm for finding maximum flows in networks
+Normal rank
@@ Property / cites work @@
+Binary Search Trees of Bounded Balance
@@ Property / cites work: Binary Search Trees of Bounded Balance / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+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 @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank