Deterministic distributed edge-coloring with fewer colors
DOI10.1145/3188745.3188906zbMath1428.68378arXiv1711.05469OpenAlexW2963840696MaRDI QIDQ5230307
Yannic Maus, Jara Uitto, Mohsen Ghaffari, Fabian Kuhn
Publication date: 22 August 2019
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.05469
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distributed algorithms (68W15)
Related Items (8)
This page was built for publication: Deterministic distributed edge-coloring with fewer colors