Ola Svensson

activity

20232026

most citedOnline Edge Coloring is (Nearly) as Easy as Offline

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

collaborators

Showing 2023Show all

1 paper · 1 filter

cs.DS2023

Simple and Asymptotically Optimal Online Bipartite Edge Coloring

Joakim Blikstad, Ola Svensson, Radu Vintan +1

We provide a simple online $Δ (1 + o (1))$ -edge-coloring algorithm for bipartite graphs of maximum degree $Δ = ω (lo g n)$ under adversarial vertex arrivals on one side of the graph. Our…