Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor (Q2383600): 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.1016/j.tcs.2007.03.046
+Normal rank
@@ Property / OpenAlex ID @@
+W2122506411
@@ Property / OpenAlex ID: W2122506411 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325546
@@ Property / cites work: Q4325546 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044351
@@ Property / cites work: Q3044351 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Finding the upper envelope of n line segments in O(n log n) time
+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 @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank