Relabeling Algorithms on Dynamic Graphs

Florent Marchand de Kerchove (1)

1 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes

Distributed algorithms executed over dynamic graphs are difficult to study due to the limited knowledge of decentralized algorithms, the uncertainty dynamism in graphs entails, and the myriad of competing and immature models. One particular framework combining relabeling systems and evolving graphs struck us as both elegant and sound [CCF12]. We use this framework to ground our contributions to the domain of distributed algorithms, which are threefold: (1) we provide a sufficient condition for the decentralized counting algorithm by Casteigts [Cas07], (2) we define conditions with stronger guarantees, (3) we give a novel counting algorithm which has the property of local detection of termination. In addition, we outline algorithms for the naming problem using the same framework.

Mots clés: evolving graphs; counting; local detection of termination; Relabeling algorithms

Domaines: Algorithme et structure de données [cs.DS]; Langage de programmation [cs.PL]

Florent Marchand de Kerchove. Relabeling Algorithms on Dynamic Graphs. [Internship report] Université du Havre. 2012. ⟨hal-00723185⟩