Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269): Difference between revisions

@@ Property / cites work @@
+Parallel Matrix and Graph Algorithms
@@ Property / cites work: Parallel Matrix and Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Binary Trees and Parallel Scheduling Algorithms
@@ Property / cites work: Binary Trees and Parallel Scheduling Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+An improved parallel algorithm that computes the BFS numbering of a directed graph
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Work-Preserving Speed-Up of Parallel Matrix Computations
+Normal rank
@@ Property / cites work @@
+Fast and efficient solution of path algebra problems
+Normal rank
@@ Property / cites work @@
+The parallel computation of minimum cost paths in graphs by stream contraction
+Normal rank
@@ Property / cites work @@
+Probabilistic Parallel Algorithms for Sorting and Selection
+Normal rank
@@ Property / cites work @@
+A new upper bound on the complexity of the all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Parallelism in Comparison Problems
@@ Property / cites work: Parallelism in Comparison Problems / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02523680
+Normal rank
@@ Property / OpenAlex ID @@
+W2033740214
@@ Property / OpenAlex ID: W2033740214 / rank @@
+Normal rank