Dynamically Maintaining Shortest Path Trees under Batches of Updates (Q2868652): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-03578-9_24
+Normal rank
@@ Property / OpenAlex ID @@
+W2115106512
@@ Property / OpenAlex ID: W2115106512 / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchical Hub Labelings for Shortest Paths
@@ Property / cites work: Hierarchical Hub Labelings for Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
+Normal rank
@@ Property / cites work @@
+Maintaining shortest paths under deletions in weighted directed graphs
+Normal rank
@@ Property / cites work @@
+Q4875168
@@ Property / cites work: Q4875168 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic multi-level overlay graphs for shortest paths
+Normal rank
@@ Property / cites work @@
+Speeding Up Dynamic Shortest-Path Algorithms
@@ Property / cites work: Speeding Up Dynamic Shortest-Path Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Path Tree Computation in Dynamic Graphs
@@ Property / cites work: Shortest Path Tree Computation in Dynamic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+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 @@
+Fully dynamic shortest paths in digraphs with arbitrary arc weights
+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 @@
+Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
+Normal rank