Graph coloring conditions for the existence of solutions to the timetable problem
暂无分享,去创建一个
[1] LionsJohn. Matrix reduction using the Hungarian method for the generation of school timetables , 1966 .
[2] Calvin C. Gotlieb,et al. The Construction of Class-Teacher Time-Tables , 1962, IFIP Congress.
[3] John Lions. Matrix reduction using the Hungarian method for the generation of school timetables , 1966, CACM.
[4] J. E. L. Peck,et al. Algorithm 286: Examination scheduling , 1966, CACM.
[5] Bruce P. Graham,et al. An Algorithm for Determining the Chromatic Number of a Graph , 1973, SIAM J. Comput..
[6] Graham Smith,et al. On Lion's counter example for Gotlieb's method for the construction of school timetables , 1974, CACM.
[7] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..
[8] John Lions. Some Results Concerning the Reduction of Binary Matrices , 1971, JACM.
[9] M. A. H. Dempster. On the Gotlieb-Csima time-tabling algorithm , 1968 .
[10] John Lions,et al. A generalization of a method for the construction of class/teacher timetables , 1968, IFIP Congress.
[11] J. Tartar,et al. Generalized Graph Colorations , 1975 .
[12] J. Lions,et al. The Ontario school scheduling program , 1967, Comput. J..
[13] D. de Werra. Construction of School Timetables by Flow Methods. , 1971 .