Complexity of the Online Vertex Coloring Problem

Abstract

We study online algorithms with advice for the problem of coloring graphs which come as input vertex by vertex. We consider the class of all 3-colorable graphs and its sub-classes of chordal and maximal outerplanar graphs, respectively. We show that, in the case of the first two classes, for coloring optimally, essentially log2 3 advice bits per vertex (bpv… (More)

6 Figures and Tables

Topics

  • Presentations referencing similar topics