Faster swap edge computation in minimum diameter spanning trees (Q2428664): Difference between revisions

@@ Property / cites work @@
+On computing a longest path in a tree
@@ Property / cites work: On computing a longest path in a tree / 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 @@
+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 @@
+Finding the most vital node of a shortest path.
@@ Property / cites work: Finding the most vital node of a shortest path. / rank @@
+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 @@
+Nearly linear time minimum spanning tree maintenance for transient node failures
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+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