On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs
AbstractIn the online coloring problem the vertices are revealed one by one to an online algorithm, which has to color them immediately as they appear. The advice complexity attempts to measure how much knowledge of the future is neccessary to achieve a given competitive ratio. Here, we examine coloring of bipartite graphs, proper and the conflict-free coloring of k-uniform hypergraphs and we provide lower and upper bounds for the number of bits of advice to achieve the optimal cost. For bipartite graphs the upper bound n − 2 is tight. For the proper coloring, n − 2k bits are necessary and n − 2 bits are sufficient, while for the conflict-free coloring case n − 2 bits of advice are neccessary and sufficient to color optimally if k > 3.
Download data is not yet available.
How to Cite
Nagy-György, J. (2018). On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs. Acta Cybernetica, 23(3), 929-938. https://doi.org/10.14232/actacyb.23.3.2018.13