Making local algorithms wait-free: the case of ring coloring

DOI10.1007/978-3-319-49259-9_9zbMath1425.68030OpenAlexW2546456447MaRDI QIDQ5918189

Carole Delporte, Michel Raynal, Hugues Fauconnier, Sergio Rajsbaum, Armando Castañeda

Publication date: 22 November 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49259-9_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

This page was built for publication: Making local algorithms wait-free: the case of ring coloring