Michael Elkin

collaborators

2 papers

cs.DS2026

Efficient Parallel $(I^ + 1)$ -Edge-Coloring

Michael Elkin, Ariel Khuzman

We study the $(I^ + 1)$ -edge-coloring problem in the parallel $(PRAM)$ model of computation. The celebrated Vizing's theorem [Viz64] states that every simple grap…

cs.DS2024

Deterministic Simple $(I^ + ε I^\pm)$ -Edge-Coloring in Near-Linear Time

Michael Elkin, Ariel Khuzman

We study the edge-coloring problem in simple $n$ -vertex $m$ -edge graphs with maximum degree $I^$ . This is one of the most classical and fundamental graph-algorithmic problems. Vizi…

Efficient Parallel (I^+1)-Edge-Coloring

Deterministic Simple (I^+εI^±)-Edge-Coloring in Near-Linear Time

Efficient Parallel $(I^ + 1)$ -Edge-Coloring

Deterministic Simple $(I^ + ε I^\pm)$ -Edge-Coloring in Near-Linear Time