论文信息 - Coloring interval graphs with first-fit - 字舞流文

Coloring interval graphs with first-fit

Abstract Improved bounds on the performance of the on-line graph coloring algorithm First-Fit on interval graphs are obtained.

Jun Qin | Hal A. Kierstead | H. Kierstead | Jun Qin

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Hal A. Kierstead,et al. On-Line Coloring and Recursive Graph Theory , 1994, SIAM J. Discret. Math..

[3] Marek Chrobak,et al. On Some Packing Problem Related to Dynamic Storage Allocation , 1988, RAIRO Theor. Informatics Appl..

[4] Jordan Gergov,et al. Approximation Algorithms for Dynamic Storage Allocation , 1996 .

[5] H. A. Kierstead,et al. The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..

[6] Henry A. Kierstead,et al. An effective version of Dilworth’s theorem , 1981 .

[7] András Gyárfás,et al. On-line and first fit colorings of graphs , 1988, J. Graph Theory.

[8] Douglas R. Woodall. The Bay Restaurant — A Linear Storage Problem , 1974 .

[9] Hal A. Kierstead,et al. On-Line and First-Fit Coloring of Graphs That Do Not Induce P5 , 1995, SIAM J. Discret. Math..