Fully dynamic all pairs shortest paths with real edge weights (Q2496318): Difference between revisions

@@ Property / Wikidata QID @@
+Q61609589
@@ Property / Wikidata QID: Q61609589 / 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.jcss.2005.05.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2097458838
@@ Property / OpenAlex ID: W2097458838 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Incremental algorithms for minimal length paths
@@ Property / cites work: Incremental algorithms for minimal length paths / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic all pairs shortest paths with real edge weights
+Normal rank
@@ Property / cites work @@
+Q4737195
@@ Property / cites work: Q4737195 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Q3679232
@@ Property / cites work: Q3679232 / rank @@
+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 @@
+Semidynamic algorithms for maintaining single-source shortest path trees
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths for graphs with small integer length edges
+Normal rank
@@ Property / cites work @@
+Q4252752
@@ Property / cites work: Q4252752 / rank @@
+Normal rank
@@ Property / cites work @@
+Maintaining minimum spanning trees in dynamic graphs
+Normal rank
@@ Property / cites work @@
+Randomized fully dynamic graph algorithms with polylogarithmic time per operation
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Q4553236
@@ Property / cites work: Q4553236 / rank @@
+Normal rank
@@ Property / cites work @@
+An Incremental Algorithm for a Generalization of the Shortest-Path Problem
+Normal rank
@@ Property / cites work @@
+On the computational complexity of dynamic graph problems
+Normal rank
@@ Property / cites work @@
+The parametric problem of shortest distances
@@ Property / cites work: The parametric problem of shortest distances / 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 @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+High-Probability Parallel Transitive-Closure Algorithms
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths using bridging sets and rectangular matrix multiplication
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2496318