Advice Complexity of the Online Coloring Problem

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.

[1]  Venkatesan Guruswami,et al.  On the Hardness of 4-Coloring a 3-Colorable Graph , 2004, SIAM J. Discret. Math..

[2]  Nathan Linial,et al.  On the Hardness of Approximating the Chromatic Number , 2000, Comb..

[3]  Pierre Fraigniaud,et al.  Online computation with advice , 2009, Theor. Comput. Sci..

[4]  Juraj Hromkovic,et al.  Information Complexity of Online Problems , 2010, MFCS.

[5]  Petr Hliněný,et al.  Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings , 2010, MFCS.

[6]  Michal Forisek,et al.  Advice Complexity of Online Coloring for Paths , 2012, LATA.

[7]  Sebastian Seibert,et al.  Advice Complexity of the Online Vertex Coloring Problem , 2012 .

[8]  Hal A. Kierstead,et al.  On-line Graph Coloring , 1991, On-Line Algorithms.

[9]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[10]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[11]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[12]  Henry Kierstead,et al.  Chapter 18 Recursive and on-line graph coloring , 1998 .

[13]  Susanne Albers,et al.  On‐Line Algorithms , 2013 .

[14]  J. Hromkovic,et al.  Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series) , 2005 .

[15]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[16]  Sundar Vishwanathan.  Randomized Online Graph Coloring , 1992, J. Algorithms.

[17]  Lucia Keller,et al.  Online Coloring of Bipartite Graphs with and without Advice , 2012, Algorithmica.

[18]  Michael E. Saks,et al.  An on-line graph coloring algorithm with sublinear performance ratio , 1989, Discret. Math..

[19]  Stefan Dobrev,et al.  How Much Information about the Future Is Needed? , 2008, SOFSEM.

[20]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[21]  Mária Bieliková,et al.  SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings , 2008, SOFSEM.

[22]  Venkatesan Guruswami,et al.  On the hardness of 4-coloring a 3-collorable graph , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[23]  Dennis Komm,et al.  On the Advice Complexity of Online Problems , 2009, ISAAC.

[24]  Dennis Komm,et al.  On the Advice Complexity of the k-Server Problem , 2011, ICALP.