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

DOI10.1007/S10951-009-0149-1MaRDI QIDQ633552zbMATH OpenOpenAlexFDO

Authors Mathieu Bouchard, Mirjana Čangalović, Alain Hertz

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)

Recommendations

• About equivalent interval colorings of weighted graphs
• scientific article; zbMATH DE number 1588325
• Automata, Languages and Programming
• Description and generation of all minimal colorings of an interval graph, and the solution of related problems.
• Bandwidth consecutive multicolorings of graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1149402 (Why is no real title available?)
• scientific article; zbMATH DE number 969115 (Why is no real title available?)
• About equivalent interval colorings of weighted graphs
• Algorithms for finding in the lump both bounds of the chromatic number of a graph
• Approximate Colouring Algorithms for Composite Graphs
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths

Cited in

(2)

• Description and generation of all minimal colorings of an interval graph, and the solution of related problems.
• About equivalent interval colorings of weighted graphs

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)