Computing all the best swap edges distributively
DOI10.1016/J.JPDC.2008.03.002zbMATH Open1243.68055OpenAlexW1700848872MaRDI QIDQ436830FDOQ436830
Authors: L. Pagli, P. Flocchini, G. Prencipe, N. Santoro, Peter Widmayer 
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.03.002
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Parallel algorithms in computer science (68W10) Distributed systems (68M14)
Cites Work
- Applications of Path Compression on Balanced Trees
- Title not available (Why is that?)
- The multi-tree approach to reliability in distributed networks
- Title not available (Why is that?)
- Swapping a failing edge of a single source shortest paths tree is good and fast
- Single backup table schemes for shortest-path routing
- Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
- Sparser: A Paradigm for Running Distributed Algorithms
- Structural Information and Communication Complexity
Cited In (9)
- Faster swap edge computation in minimum diameter spanning trees
- A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
- Faster Swap Edge Computation in Minimum Diameter Spanning Trees
- Stable routing under the Spanning Tree Protocol
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
- Title not available (Why is that?)
- Distributed Computing - IWDC 2004
- Principles of Distributed Systems
- Linear time distributed swap edge algorithms
This page was built for publication: Computing all the best swap edges distributively
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436830)
