A Distributed Algorithm for the Minimum Diameter Spanning Tree Problem


International audienceWe present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G=(V,E,\omega). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(|V|) time complexity and O(|V| |E|) message complexity

Similar works

Full text


HAL-Paris 13

Full text is not available
oaioai:HAL:hal-00082535v1Last time updated on 11/11/2016

This paper was published in HAL-Paris 13.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.