Efficient Union-Find for planar graphs and other sparse graph classes (Q1274324): Difference between revisions

@@ Property / cites work @@
+A complement to Tarjan's result about the lower bound on the complexity of the set union problem
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A general approach to connected-component labeling for arbitrary image representations
+Normal rank
@@ Property / cites work @@
+Two linear time Union--Find strategies for image processing
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Q4003964
@@ Property / cites work: Q4003964 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the union-find and the split-find problem on pointer machines
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219751
@@ Property / cites work: Q3219751 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385511
@@ Property / cites work: Q4385511 / rank @@
+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