Brief Announcement
From MaRDI portal
Publication:5197677
DOI10.1145/3212734.3212787zbMath1428.68384arXiv1805.04544OpenAlexW2885131583MaRDI QIDQ5197677
Christian Konrad, Victor Zamaraev
Publication date: 19 September 2019
Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.04544
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (3)
Distributed minimum vertex coloring and maximum independent set in chordal graphs ⋮ Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs ⋮ Distributed interactive proofs for the recognition of some geometric intersection graph classes
This page was built for publication: Brief Announcement
