A faster computation of all the best swap edges of a shortest paths tree (Q893317): Difference between revisions

@@ 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.1007/s00453-014-9912-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2173847299
@@ Property / OpenAlex ID: W2173847299 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding best swap edges minimizing the routing cost of a spanning tree
+Normal rank
@@ Property / cites work @@
+A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
+Normal rank
@@ Property / cites work @@
+Strict fibonacci heaps
@@ Property / cites work: Strict fibonacci heaps / 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 shortest paths tree by minimizing the average stretch factor
+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 @@
+Exact and approximate truthful mechanisms for the shortest paths tree problem
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Maintaining spanning trees of small diameter
@@ Property / cites work: Maintaining spanning trees of small diameter / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938662
@@ Property / cites work: Q4938662 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for 2-edge-connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+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