Fast distributed computation of distances in networks

Abstract

This paper presents a distributed algorithm to simultaneously compute the diameter, radius and node eccentricity in all nodes of a synchronous network. Such topological information may be useful as input to configure other algorithms. Previous approaches have been modular, progressing in sequential phases using building blocks such as BFS tree construction… (More)
DOI: 10.1109/CDC.2012.6426872

Topics

5 Figures and Tables

Slides referencing similar topics