Static and dynamic parallel computation of connected components (Q1322111): Difference between revisions

@@ Property / cites work @@
+Efficient parallel algorithms for some graph problems
+Normal rank
@@ Property / cites work @@
+Q3140396
@@ Property / cites work: Q3140396 / 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 @@
+An efficient and fast parallel-connected component algorithm
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for the connected components and minimal spanning tree problems
+Normal rank
@@ Property / cites work @@
+An O(log n) algorithm for parallel update of minimum spanning trees
+Normal rank
@@ Property / cites work @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+Normal rank