A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

DOI10.1007/978-3-540-75142-7_22MaRDI QIDQ3523213zbMATH OpenOpenAlexFDO

Authors Beat Gfeller, N. Santoro, Peter Widmayer

Publication date 2 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1305082
• Computing all the best swap edges distributively
• Faster swap edge computation in minimum diameter spanning trees
• Faster Swap Edge Computation in Minimum Diameter Spanning Trees
• Computing all best swaps for minimum-stretch tree spanners

Cited in

(10)

• Faster swap edge computation in minimum diameter spanning trees
• Principles of Distributed Systems
• Computing all the best swap edges distributively
• Faster Swap Edge Computation in Minimum Diameter Spanning Trees
• An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
• Linear time distributed swap edge algorithms
• Linear time distributed swap edge algorithms
• An improved algorithm for computing all the best swap edges of a tree spanner
• An edge-swap heuristic for finding dense spanning trees
• Finding best swap edges minimizing the routing cost of a spanning tree

This page was built for publication: A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523213)