Partially dynamic efficient algorithms for distributed shortest paths (Q2268860): Difference between revisions

@@ Property / describes a project that uses @@
+OMNet++
@@ Property / describes a project that uses: OMNet++ / 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.tcs.2009.11.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2030680125
@@ Property / OpenAlex ID: W2030680125 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3361866
@@ Property / cites work: Q3361866 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A fully dynamic algorithm for distributed shortest paths.
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
+Normal rank
@@ Property / cites work @@
+Another adaptive distributed shortest path algorithm
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed shortest-path protocols for time-dependent networks
+Normal rank
@@ Property / cites work @@
+On the computational complexity of dynamic graph problems
+Normal rank
@@ Property / cites work @@
+On finding and updating shortest paths distributively
+Normal rank