Parallel breadth-first search algorithms for trees and graphs (Q3318124): 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.1080/00207168408803413
+Normal rank
@@ Property / OpenAlex ID @@
+W2140391860
@@ Property / OpenAlex ID: W2140391860 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4172077
@@ Property / cites work: Q4172077 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4195963
@@ Property / cites work: Q4195963 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Reducible Flow Graphs
@@ Property / cites work: Characterizations of Reducible Flow Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+New Parallel-Sorting Schemes
@@ Property / cites work: New Parallel-Sorting Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Computations in Graph Theory
@@ Property / cites work: Parallel Computations in Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank