An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723): 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.1016/j.jda.2016.09.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2531762745
@@ Property / OpenAlex ID: W2531762745 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3948568
@@ Property / cites work: Q3948568 / rank @@
+Normal rank
@@ Property / cites work @@
+Regularity Lemmas and Combinatorial Algorithms
@@ Property / cites work: Regularity Lemmas and Combinatorial Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+More algorithms for all-pairs shortest paths in weighted graphs
+Normal rank
@@ Property / cites work @@
+Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
+Normal rank
@@ Property / cites work @@
+Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / 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 @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+All pairs shortest distances for graphs with small integer length edges
+Normal rank
@@ Property / cites work @@
+Improved algorithm for all pairs shortest paths
@@ Property / cites work: Improved algorithm for all pairs shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
+Normal rank
@@ Property / cites work @@
+An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+Q4737147
@@ Property / cites work: Q4737147 / rank @@
+Normal rank
@@ Property / cites work @@
+A Shortest Path Algorithm for Real-Weighted Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+A new upper bound on the complexity of the all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Undirected single-source shortest paths with positive integer weights in linear time
+Normal rank
@@ Property / cites work @@
+Faster all-pairs shortest paths via circuit complexity
+Normal rank
@@ Property / cites work @@
+An improved combinatorial algorithm for Boolean matrix multiplication
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths using bridging sets and rectangular matrix multiplication
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:350723