Loading...
report
Online Coloring of Comparability Graphs: some results
2007
We study online partitioning of posets from a graph theoretical point of view, which is coloring and cocoloring in comparability graphs. For the coloring problem, we analyse the First-Fit algorithm and show a ratio of $O(\sqrt{n})$; furthermore, we devise an algorithm with a competitivity ratio of $\frac{\chi+1}{2}$. For the cocoloring problem, we point out a tight bound of $\frac{n}{4} + \frac{1}{2}$ and we give better bounds in some more restricted cocoloring problems.
Loading...
Name
comparability-online.pdf
Access type
openaccess
Size
234.39 KB
Format
Adobe PDF
Checksum (MD5)
d556bf838b18206189381c52028e3b89