A faster computation of all the best swap edges of a shortest paths tree
From MaRDI portal
Publication:893317
DOI10.1007/S00453-014-9912-6zbMATH Open1325.68167OpenAlexW2173847299MaRDI QIDQ893317FDOQ893317
Authors: D. Bilò, Luciano Gualà, Guido Proietti 
Publication date: 19 November 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9912-6
Recommendations
- A faster computation of all the best swap edges of a shortest paths tree
- Structural Information and Communication Complexity
- Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
- Publication:4938662
- Swapping a failing edge of a single source shortest paths tree is good and fast
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
- Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
- The swap edges of a multiple-sources routing tree
- Finding best swap edges minimizing the routing cost of a spanning tree
- Algorithms and Computation
- Polynomial time algorithms for 2-edge-connectivity augmentation problems
- Faster swap edge computation in minimum diameter spanning trees
- Strict Fibonacci heaps
- Maintaining spanning trees of small diameter
- Exact and approximate truthful mechanisms for the shortest paths tree problem
- A faster computation of all the best swap edges of a shortest paths tree
- Title not available (Why is that?)
Cited In (11)
- An improved algorithm for computing all the best swap edges of a tree spanner
- Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
- Computing Best Swaps in Optimal Tree Spanners
- A Faster Computation of All the Best Swap Edges of a Tree Spanner
- Swapping a failing edge of a single source shortest paths tree is good and fast
- A faster computation of all the best swap edges of a shortest paths tree
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
- Principles of Distributed Systems
- Linear time distributed swap edge algorithms
- Structural Information and Communication Complexity
This page was built for publication: A faster computation of all the best swap edges of a shortest paths tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893317)
