GRAPH-COLORING ALGORITHM FOR LARGE SCHEDULING PROBLEMS

[1] AHO AV, 1974, DESIGN ANAL COMPUTER, P364

[2] [Anonymous], 1968, J COMBIN THEORY

[3] Bondy J. A., 1969, Journal of Combinatorial Theory, Series A, V7, P96, DOI 10.1016/S0021-9800(69)80010-4

[4] FINAL EXAMINATION SCHEDULING [J]. COMMUNICATIONS OF THE ACM, 1964, 7 (08) : 494 - 498

[5] On colouring the nodes of a network [J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 : 194 - 197

[6] CHROMATIC SCHEDULING AND CHROMATIC NUMBER PROBLEM [J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1972, 19 (04): : 456 - 463

[7] ALGORITHM FOR CHROMATIC NUMBER OF A GRAPH [J]. COMPUTER JOURNAL, 1971, 14 (01) : 38 - +

[8] CHRISTOFIDES N, 1975, GRAPH THEORY ALGORIT, P58

[9] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49

[10] SCHEDULING UNIVERSITY COURSE EXAMINATIONS BY COMPUTER [J]. COMMUNICATIONS OF THE ACM, 1967, 10 (04) : 235 - &

[1] AHO AV, 1974, DESIGN ANAL COMPUTER, P364

[2] [Anonymous], 1968, J COMBIN THEORY

[3] Bondy J. A., 1969, Journal of Combinatorial Theory, Series A, V7, P96, DOI 10.1016/S0021-9800(69)80010-4

[4] FINAL EXAMINATION SCHEDULING [J]. COMMUNICATIONS OF THE ACM, 1964, 7 (08) : 494 - 498

[5] On colouring the nodes of a network [J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 : 194 - 197

[6] CHROMATIC SCHEDULING AND CHROMATIC NUMBER PROBLEM [J]. MANAGEMENT SCIENCE SERIES B-APPLICATION, 1972, 19 (04): : 456 - 463

[7] ALGORITHM FOR CHROMATIC NUMBER OF A GRAPH [J]. COMPUTER JOURNAL, 1971, 14 (01) : 38 - +

[8] CHRISTOFIDES N, 1975, GRAPH THEORY ALGORIT, P58

[9] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J]. JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49

[10] SCHEDULING UNIVERSITY COURSE EXAMINATIONS BY COMPUTER [J]. COMMUNICATIONS OF THE ACM, 1967, 10 (04) : 235 - &