Computing all the best swap edges distributively (Q436830): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jpdc.2008.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1700848872
@@ Property / OpenAlex ID: W1700848872 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparser: A Paradigm for Running Distributed Algorithms
+Normal rank
@@ Property / cites work @@
+Structural Information and Communication Complexity
+Normal rank
@@ Property / cites work @@
+The multi-tree approach to reliability in distributed networks
+Normal rank
@@ Property / cites work @@
+Single backup table schemes for shortest-path routing
+Normal rank
@@ Property / cites work @@
+Q3026357
@@ Property / cites work: Q3026357 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
+Normal rank
@@ Property / cites work @@
+Swapping a failing edge of a single source shortest paths tree is good and fast
+Normal rank
@@ Property / cites work @@
+Q4878300
@@ Property / cites work: Q4878300 / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+Normal rank