GRAPH-COLORING ALGORITHM FOR LARGE SCHEDULING PROBLEMS

被引：299
作者：
LEIGHTON, FT
机构：
[1] NBS, CTR APPL MATH, WASHINGTON, DC 20234 USA
[2] PRINCETON UNIV, PRINCETON, NJ 08540 USA
来源：
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS | 1979年 / 84卷 / 06期
关键词：
D O I：
10.6028/jres.084.024
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
引用
收藏
页码：489 / 506
页数：18
相关论文
共 23 条
[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].
BRODER, S .
COMMUNICATIONS OF THE ACM, 1964, 7 (08) :494-498
[5]   On colouring the nodes of a network [J].
Brooks, RL .
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197
[6]   CHROMATIC SCHEDULING AND CHROMATIC NUMBER PROBLEM [J].
BROWN, JR .
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1972, 19 (04) :456-463
[7]   ALGORITHM FOR CHROMATIC NUMBER OF A GRAPH [J].
CHRISTOFIDES, N .
COMPUTER JOURNAL, 1971, 14 (01) :38-+
[8]  
CHRISTOFIDES N, 1975, GRAPH THEORY ALGORIT, P58
[9]   COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING [J].
GAREY, MR ;
JOHNSON, DS .
JOURNAL OF THE ACM, 1976, 23 (01) :43-49
[10]   SCHEDULING UNIVERSITY COURSE EXAMINATIONS BY COMPUTER [J].
HALL, AD ;
ACTON, FS .
COMMUNICATIONS OF THE ACM, 1967, 10 (04) :235-&
123