ResearchTrend.AI
Coloring Fast Without Learning Your Neighbors' Colors

Coloring Fast Without Learning Your Neighbors' Colors

Magnús M. Halldórsson
Fabian Kuhn
Yannic Maus
Alexandre Nolin
ArXiv (abs)PDFHTML

Papers citing "Coloring Fast Without Learning Your Neighbors' Colors"

9 / 9 papers shown
Title
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
Maxime Flin
Magnús M. Halldórsson
Alexandre Nolin
63
2
0
20 Aug 2024
Adjacency Sketches in Adversarial Environments
Adjacency Sketches in Adversarial Environments
M. Naor
Eugene Pekel
AAML
18
2
0
07 Sep 2023
Fast Coloring Despite Congested Relays
Fast Coloring Despite Congested Relays
Maxime Flin
Magnús M. Halldórsson
Alexandre Nolin
60
3
0
02 Aug 2023
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
Leonid Barenboim
Uri Goldenberg
59
2
0
07 May 2023
Distributed Symmetry Breaking on Power Graphs via Sparsification
Distributed Symmetry Breaking on Power Graphs via Sparsification
Yannic Maus
Saku Peltonen
Jara Uitto
55
11
0
14 Feb 2023
Overcoming Congestion in Distributed Coloring
Overcoming Congestion in Distributed Coloring
Magnús M. Halldórsson
Alexandre Nolin
Tigran Tonoyan
35
16
0
28 May 2022
Near-Optimal Distributed Degree+1 Coloring
Near-Optimal Distributed Degree+1 Coloring
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
Tigran Tonoyan
50
39
0
01 Dec 2021
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Yannic Maus
Jara Uitto
50
10
0
05 Aug 2021
Superfast Coloring in CONGEST via Efficient Color Sampling
Superfast Coloring in CONGEST via Efficient Color Sampling
Magnús M. Halldórsson
Alexandre Nolin
63
15
0
08 Feb 2021