The Complexity of Distributed Edge Coloring with Small Palettes

14 August 2017

Papers citing "The Complexity of Distributed Edge Coloring with Small Palettes"

12 / 12 papers shown

Title
Testing Spreading Behavior in Networks with Arbitrary Topologies S. Chechik Tianyi Zhang 16 10 0 11 Sep 2023
Fast algorithms for Vizing's theorem on bounded degree graphs Anton Bernshteyn A. Dhawan 24 13 0 09 Mar 2023
The Landscape of Distributed Complexities on Trees and Beyond Christoph Grunau Václav Rozhon S. Brandt 30 18 0 09 Feb 2022
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition David G. Harris Hsin-Hao Su H. Vu 25 9 0 22 Sep 2020
Truly Tight-in- $Δ$ Bounds for Bipartite Maximal Matching and Variants S. Brandt Dennis Olivetti 15 24 0 19 Feb 2020
Faster Deterministic Distributed Coloring Through Recursive List Coloring Fabian Kuhn 26 34 0 08 Jul 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 20 93 0 08 Jan 2019
Towards the Locality of Vizing's Theorem Hsin-Hao Su H. Vu 22 28 0 02 Jan 2019
Hardness of minimal symmetry breaking in distributed computing Alkida Balliu J. Hirvonen Dennis Olivetti Jukka Suomela 34 30 0 05 Nov 2018
Almost Global Problems in the LOCAL Model Alkida Balliu S. Brandt Dennis Olivetti Jukka Suomela 24 42 0 12 May 2018
On Derandomizing Local Distributed Algorithms M. Ghaffari David G. Harris Fabian Kuhn OOD FedML 35 133 0 06 Nov 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 28 96 0 20 Apr 2017