Approximate Colouring Algorithms for Composite Graphs
From MaRDI portal
Publication:4747899
DOI10.2307/2581125zbMath0508.90048MaRDI QIDQ4747899
C. H. Elphick, A. T. Clementson
Publication date: 1983
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2581125
comparison of algorithms; school timetabling; approximate colouring algorithms; colouring of composite graphs
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
05C15: Coloring of graphs and hypergraphs
Related Items
On a reduction of the interval coloring problem to a series of bandwidth coloring problems, About equivalent interval colorings of weighted graphs, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths