All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time (Q2480908): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-007-9062-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2623873233
@@ Property / OpenAlex ID: W2623873233 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Q5616735
@@ Property / cites work: Q5616735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542546
@@ Property / cites work: Q4542546 / rank @@
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+A more efficient algorithm for the min-plus multiplication
+Normal rank
@@ Property / cites work @@
+Quasiconvex Analysis of Backtracking Algorithms
@@ Property / cites work: Quasiconvex Analysis of Backtracking Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Clique partitions, graph compression and speeding-up algorithms
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths 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 @@
+Computing dominances in \(E^ n\)
@@ Property / cites work: Computing dominances in \(E^ n\) / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to all-pairs shortest paths on real-weighted graphs
+Normal rank
@@ Property / cites work @@
+A Shortest Path Algorithm for Real-Weighted Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+A new upper bound on the complexity of the all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+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 @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+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:2480908