Distributed Coloring Algorithms
Distributed Coloring Algorithms is a class of distributed algorithms that solve graph coloring problems by assigning colors to vertices in a decentralized manner such that no adjacent vertices share the same color, with the distinguishing feature being their operation in parallel across networked processors without global knowledge of the graph.
109
Publications
6K
Citations
168
Authors
107
Institutions
Publications per year
2017–2026
27
Parents
109
Locality in Distributed Graph Algorithms
Nathan Linial · SIAM Journal on Computing · 1992 · 885 citations
Network decomposition and locality in distributed computation
Baruch Awerbuch, Michael Luby, Andrew V. Goldberg et al. · 1989 · 302 citations
On the complexity of distributed graph coloring
Fabian Kühn, Rogert Wattenhofer · 2006 · 196 citations
1–5 of 109
168
13
h-index
13
h-index
12
h-index
8
h-index
8
h-index
1–5 of 168
107
Ben-Gurion University of the Negev
Beersheba, Israel
12 h-index
22 publications
1.5K citations
ETH Zurich
Zurich, Switzerland
8 h-index
13 publications
1.1K citations
University of Michigan
Ann Arbor, United States
7 h-index
13 publications
497 citations

University of Freiburg
Freiburg im Breisgau, Germany
5 h-index
5 publications
151 citations
Humboldt-Universität zu Berlin
Berlin, Germany
4 h-index
6 publications
258 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
12 publications
192 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
4 h-index
3 publications
51 citations
Open University of Israel
Raanana, Israel
4 h-index
7 publications
166 citations
1–8 of 107
4 publications · 1.2K citations
4
h-index
4 publications · 254 citations
4
h-index
JACM · 4 publications · 172 citations
4
h-index
3 publications · 248 citations
3
h-index
Repository · 2 publications · 29 citations
2
h-index
1–5