Faster Swap Edge Computation in Minimum Diameter Spanning Trees
From MaRDI portal
Publication:3541107
DOI10.1007/978-3-540-87744-8_38zbMath1158.68430MaRDI QIDQ3541107
Publication date: 25 November 2008
Published in: Algorithms - ESA 2008 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/69265
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Finding best swap edges minimizing the routing cost of a spanning tree, Faster Swap Edge Computation in Minimum Diameter Spanning Trees
Cites Work
- Computing all the best swap edges distributively
- Swapping a failing edge of a single source shortest paths tree is good and fast
- Single backup table schemes for shortest-path routing
- 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 All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
- Fast Algorithms for Finding Nearest Common Ancestors
- A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
- Faster Swap Edge Computation in Minimum Diameter Spanning Trees
- Fibonacci heaps and their uses in improved network optimization algorithms
