Graph Structure Analysis and Computational Tractability of Scheduling Problems
Sergey V. Sevastyanov, Alexander V. Kononov · 2009
This chapter contains sections titled: Introduction The Connected List Coloring Problem Some Practical Problems Reducible to the CLC Problem A Parameterized Class of Subproblems of the CLC Problem Complexities of Eight Representatives of Class CLC(X) A Basis System of Problems Conclusion References