On a reduction of the interval coloring problem to a series of bandwidth coloring problems

DOI10.1007/S10951-009-0149-1zbMATH Open1208.05025OpenAlexW2092058125MaRDI QIDQ633552FDOQ633552

Mirjana Čangalović, Alain Hertz, Mathieu Bouchard

Publication date: 1 April 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-009-0149-1

zbMATH Keywords

graph coloringinterval coloringschool timetablingbandwidth coloringmemory allocation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Algorithms for finding in the lump both bounds of the chromatic number of a graph
• Approximate Colouring Algorithms for Composite Graphs
• About equivalent interval colorings of weighted graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On a reduction of the interval coloring problem to a series of bandwidth coloring problems

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