On Distributed Colouring of Hyperbolic Random Graphs
Abstract
We analyse simple distributed colouring algorithms on hyperbolic random graphs (HRGs), a generative model capturing properties of real-world networks such as power-law degrees and large clustering. We focus on the number of rounds and the colour space needed to colour HRGs in the distributed setting.
Fields of Study & Subjects
Complex Network Analysis Techniques
Constraint Satisfaction and Optimization
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Society for Industrial and Applied Mathematics eBooks
- Pages
- 2540–2553
- Publication date
- 1 January 2026
- Language
- EN