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

DOI10.1007/978-3-540-75142-7_22zbMath1145.68590OpenAlexW2122591624MaRDI QIDQ3523213

Beat Gfeller, Nicola 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

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

Related Items (3)

Faster swap edge computation in minimum diameter spanning trees ⋮ Faster Swap Edge Computation in Minimum Diameter 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