In this paper we address the problem of using pairwise measures associated with the edges of a graph to obtain absolute consistent measures associated with the nodes. This problem is known in the literature as graph synchronisation. In particular, we rigorously deal with the uncertainty affecting the measures thanks to the interval analysis approach. We propose an asynchronous, distributed algorithm that converges to an interval solution that represents all possible sharp solutions consistent with the measures.
