An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W40
@@ Property / Mathematics Subject Classification ID: 68W40 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6662313
@@ Property / zbMATH DE Number: 6662313 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+all pairs shortest paths
@@ Property / zbMATH Keywords: all pairs shortest paths / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph algorithms
@@ Property / zbMATH Keywords: graph algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+upper bounds
@@ Property / zbMATH Keywords: upper bounds / rank @@
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:350723