Approximate Colouring Algorithms for Composite Graphs

DOI10.2307/2581125MaRDI QIDQ4747899zbMATH OpenOpenAlexFDO

Authors A. T. Clementson, C. H. Elphick

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

zbMATH Keywords

approximate colouring algorithmscolouring of composite graphscomparison of algorithmsschool timetabling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cited in

(3)

• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• On a reduction of the interval coloring problem to a series of bandwidth coloring problems
• About equivalent interval colorings of weighted graphs

This page was built for publication: Approximate Colouring Algorithms for Composite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4747899)