About equivalent interval colorings of weighted graphs
From MaRDI portal
Publication:967426
DOI10.1016/j.dam.2009.04.015zbMath1227.05141MaRDI QIDQ967426
Alain Hertz, Mirjana Čangalović, Mathieu Bouchard
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
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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