Maxime Flin

activity

20232026

most citedSublogarithmic Distributed Vertex Coloring with Optimal Number of Colors

1 citations · 1 across the 10 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DC2024

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs

Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin

Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph $H$ to be colored is locally embedded…

cs.DC2024

Decentralized Distributed Graph Coloring: Cluster Graphs

Maxime Flin, Magnus M. Halldorsson, Alexandre Nolin

Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the unde…

cs.DS2024

$(Δ + 1)$ Vertex Coloring in $O (n)$ Communication

Maxime Flin, Parth Mittal

We study the communication complexity of $(Δ + 1)$ vertex coloring, where the edges of an $n$ -vertex graph of maximum degree $Δ$ are partitioned between two players. We provide a ra…

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs

Decentralized Distributed Graph Coloring: Cluster Graphs

(Δ+1) Vertex Coloring in O(n) Communication

$(Δ + 1)$ Vertex Coloring in $O (n)$ Communication