Approximate shortest paths in weighted graphs (Q414929): Difference between revisions

@@ Property / cites work @@
+Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+More algorithms for all-pairs shortest paths in weighted graphs
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Scaling Algorithms for the Shortest Paths Problem
@@ Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+All-Pairs Shortest Paths with a Sublinear Additive Error
+Normal rank
@@ Property / cites work @@
+An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths using bridging sets and rectangular matrix multiplication
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank