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

Authors

168

  1. ME
    Michael Elkin

    Ben-Gurion University of the Negev, Israel

    14 publications · 829 citations

    13

    h-index

  2. AP
    Alessandro Panconesi

    Sapienza University of Rome, Italy

    14 publications · 787 citations

    13

    h-index

  3. LB
    Leonid Barenboim

    Ben-Gurion University of the Negev, Israel

    13 publications · 813 citations

    12

    h-index

  4. SP
    Seth Pettie

    University of Michigan, United States

    8 publications · 263 citations

    8

    h-index

  5. FK
    Fabian Kühn

    ETH Zurich, Switzerland

    8 publications · 473 citations

    8

    h-index

1–5 of 168

Venues

  1. SIAM Journal on Computing

    4 publications · 1.2K citations

    4

    h-index

  2. Distributed Computing

    4 publications · 254 citations

    4

    h-index

  3. Journal of the ACM

    JACM · 4 publications · 172 citations

    4

    h-index

  4. Journal of Parallel and Distributed Computing

    3 publications · 248 citations

    3

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 29 citations

    2

    h-index

1–5