About equivalent interval colorings of weighted graphs

DOI10.1016/j.dam.2009.04.015zbMath1227.05141OpenAlexW2151966264MaRDI QIDQ967426

Mathieu Bouchard, Mirjana Čangalović, Alain Hertz

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.015

zbMATH Keywords

weighted graphsequivalent coloringsinterval coloring problem (ICP)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (1)

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

Uses Software

• Tabu search

Cites Work

• Using tabu search techniques for graph coloring
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Interval vertex-coloring of a graph with forbidden colors
• Hybrid evolutionary algorithms for graph coloring
• A survey of local search methods for graph coloring
• Approximating interval coloring and max-coloring in chordal graphs
• Consecutive colorings of graphs
• Algorithms for finding in the lump both bounds of the chromatic number of a graph
• OPTVersusLOADin Dynamic Storage Allocation
• Approximate Colouring Algorithms for Composite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: About equivalent interval colorings of weighted graphs