Deterministic Online Bipartite Edge Coloring

We study online bipartite edge coloring, with nodes on one side of the graph revealed sequentially. The trivial greedy algorithm is $(2-o(1))$-competitive, which is optimal for graphs of low maximum degree, $\Delta=O(\log n)$ [BNMN IPL'92]. Numerous online edge-coloring algorithms outperforming...

Full description

Saved in:

Bibliographic Details
Main Authors	Blikstad, Joakim, Svensson, Ola, Vintan, Radu, Wajc, David
Format	Journal Article
Language	English
Published	07.08.2024
Subjects	Computer Science - Data Structures and Algorithms
Online Access	Get full text

Cover

Loading…

Be the first to leave a comment!