A new upper bound on the complexity of the all pairs shortest path problem (Q1199881): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065051
@@ Property / cites work: Q4065051 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484355
@@ Property / cites work: Q3484355 / rank @@
+Normal rank
@@ 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 more efficient algorithm for the min-plus multiplication
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Bit complexity of matrix products
@@ Property / cites work: Bit complexity of matrix products / rank @@
+Normal rank
@@ Property / cites work @@
+An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
+Normal rank