A new technique for distributed symmetry breaking
DOI10.1145/1835698.1835760zbMath1315.68275OpenAlexW2119761906MaRDI QIDQ5176204
No author found.
Publication date: 2 March 2015
Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1835698.1835760
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items
Uses Software
Cites Work
This page was built for publication: A new technique for distributed symmetry breaking