MIS and MM on hyperbolic random graphs admit Õ(log^{5/3} log n)-round LOCAL algorithms and an Ω(log log n / log log log n) lower bound, via new d-ary tree substructures.
Typical distances in a geo- metric model for complex networks
1 Pith paper cite this work, alongside 8 external citations. Polarity classification is still indexing.
1
Pith paper citing it
8
external citations · OpenAlex
fields
cs.DC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Distributed Symmetry Breaking on Hyperbolic Random Graphs
MIS and MM on hyperbolic random graphs admit Õ(log^{5/3} log n)-round LOCAL algorithms and an Ω(log log n / log log log n) lower bound, via new d-ary tree substructures.