Determining connected components in linear time by a linear number of processors (Q1108033): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(87)90219-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2041451693
@@ Property / OpenAlex ID: W2041451693 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for some graph problems
+Normal rank
@@ Property / cites work @@
+Parallel Matrix and Graph Algorithms
@@ Property / cites work: Parallel Matrix and Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146249
@@ Property / cites work: Q4146249 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing connected components on parallel computers
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
+Normal rank
@@ Property / cites work @@
+Cellular arrays for the solution of graph problems
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for the connected components and minimal spanning tree problems
+Normal rank
@@ Property / cites work @@
+Q4080720
@@ Property / cites work: Q4080720 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast, Efficient Parallel Algorithms for Some Graph Problems
+Normal rank
@@ Property / cites work @@
+The Parallel Recognition of Classes of Graphs
@@ Property / cites work: The Parallel Recognition of Classes of Graphs / rank @@
+Normal rank