However, can the nodes of a network find its diameter in O(D) time? In this paper, we answer this question negatively, by presenting a lower bound of ˜Ω(n), ...
The model of distributed computation we consider is: in each synchronous round, each node can transmit a different (but short) message to each of its neighbors.
Computing the diameter of a network is surely a global problem as one cannot hope to compute the diameter D in o(D) time. However, can the nodes of a network ...
Dec 18, 2013 · We study the problem of computing the diameter of a network in a distributed way. The model of distributed computation we consider is:
[PDF] Sublinear-Time Quantum Computation of the Diameter ... - IRIF
www.irif.fr › PAPIERS › lm-podc18
Networks cannot compute their diameter in sublinear time. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pages ...
With a simple flooding/echo process, a network can find the number of nodes in time O(D), where D is the diameter (size) of the network.
Mar 10, 2012 · The diameter of a graph G is the maximum of the set of shortest path distances between all pairs of vertices in a graph.
Networks Cannot Compute Their Diameter in Sublinear Time. Conference Paper ... We study the problem of computing the diameter of a network in a distributed way.
This paper investigates quantum distributed algorithms for exact diameter computation in the quantum CONGEST model, and shows an unconditional lower bound ...
2012. Networks cannot compute their diameter in sublinear time Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012). 1150--1162.