Geographic gossip on geometric random graphs via affine combinations

DOI10.1145/1281100.1281187zbMath1283.68271arXivcs/0612012MaRDI QIDQ5401480

Hariharan Narayanan

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0612012

zbMATH Keywords

gossip algorithms; geometric random graphs; affine combinations

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)