Approximate Colouring Algorithms for Composite Graphs
From MaRDI portal
Publication:4747899
DOI10.2307/2581125zbMath0508.90048OpenAlexW4234846886MaRDI 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 algorithmsschool timetablingapproximate colouring algorithmscolouring of composite graphs
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Related Items
On a reduction of the interval coloring problem to a series of bandwidth coloring problems, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, About equivalent interval colorings of weighted graphs
