Distributed Approximation on Power Graphs

DOI10.1145/3382734.3405750MaRDI QIDQ5854058zbMATH OpenOpenAlexWikidataFDO

Authors Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Reuven Bar-Yehuda, Sriram Pemmaraju

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer science (68-XX) Distributed systems (68M14) Distributed algorithms (68W15)

Cited in

(7)

• Distributed distance-r covering problems on sparse high-girth graphs
• Distributed distance-\(r\) covering problems on sparse high-girth graphs
• Distributed Symmetry Breaking on Power Graphs via Sparsification
• Coloring fast without learning your neighbors' colors
• Approximating bipartite minimum vertex cover in the Congest model
• Distributed symmetry breaking on power graphs via sparsification
• Sampling and output estimation in distributed algorithms and LCAs

This page was built for publication: Distributed Approximation on Power Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854058)