ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2011.04511
  4. Cited By
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without
  Network Decomposition

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition

9 November 2020
M. Ghaffari
Fabian Kuhn
ArXivPDFHTML

Papers citing "Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition"

6 / 6 papers shown
Title
Distributed Lovász Local Lemma under Bandwidth Limitations
Distributed Lovász Local Lemma under Bandwidth Limitations
Magnús M. Halldórsson
Yannic Maus
Saku Peltonen
40
2
0
12 May 2024
A Distributed Palette Sparsification Theorem
A Distributed Palette Sparsification Theorem
Maxime Flin
M. Ghaffari
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
MoE
24
7
0
16 Jan 2023
Fast Distributed Vertex Splitting with Applications
Fast Distributed Vertex Splitting with Applications
Magnús M. Halldórsson
Yannic Maus
Alexandre Nolin
28
7
0
17 Aug 2022
Overcoming Congestion in Distributed Coloring
Overcoming Congestion in Distributed Coloring
Magnús M. Halldórsson
Alexandre Nolin
Tigran Tonoyan
19
15
0
28 May 2022
Improved Deterministic $(Δ+1)$-Coloring in Low-Space MPC
Improved Deterministic (Δ+1)(Δ+1)(Δ+1)-Coloring in Low-Space MPC
A. Czumaj
Peter Davies
M. Parter
22
20
0
10 Dec 2021
Improved Distributed Fractional Coloring Algorithms
Improved Distributed Fractional Coloring Algorithms
Alkida Balliu
Fabian Kuhn
Dennis Olivetti
31
5
0
08 Dec 2021
1