Faster Swap Edge Computation in Minimum Diameter Spanning Trees (Q3541107): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1510285970
@@ Property / OpenAlex ID: W1510285970 / rank @@
+Normal rank
@@ Property / cites work @@
+Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
+Normal rank
@@ Property / cites work @@
+Computing all the best swap edges distributively
@@ Property / cites work: Computing all the best swap edges distributively / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Faster Swap Edge Computation in Minimum Diameter Spanning Trees
+Normal rank
@@ Property / cites work @@
+A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Single backup table schemes for shortest-path routing
+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 @@
+The swap edges of a multiple-sources routing tree
@@ Property / cites work: The swap edges of a multiple-sources routing tree / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3541107