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.
Distributed Interval Synchronization
Fusiello A.
;Montessoro P. L.
2024-01-01
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Distributed_Interval_Synchronization.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
531.63 kB
Formato
Adobe PDF
|
531.63 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
