TY - GEN
T1 - The optimal cost chromatic partition problem for trees and interval graphs
AU - Kroon, Leo G.
AU - Sen, Arunabha
AU - Deng, Haiyong
AU - Roy, Asim
PY - 1997
Y1 - 1997
N2 - In this paper we study the Optimal Cost Chromatic Partition (OCCP) problem for trees and interval graphs. The OCCP problem is the problem of coloring the nodes of a graph in such a way that adjacent nodes obtain different colors and that the total coloring costs are minimum. In this paper we first give a linear time algorithm for the OCCP problem for trees. The OCCP problem for interval graphs is equivalent to the Fixed Interval Scheduling Problem with machine-dependent processing costs. We show that the OCCP problem for interval graphs can be solved in polynomial time if there are only two different values for the coloring costs. However, if there are at least four different values for the coloring costs, then the OCCP problem for interval graphs is shown to be NP-hard. We also give a formulation of the latter problem as an integer linear program, and prove that the corresponding coefficient matrix is perfect if and only if the associated intersection graph does not contain an odd hole of size 7 or more as a node-induced subgraph. Thereby we prove that the Strong Perfect Graph Conjecture holds for graphs of the form K × G, where K is a clique and G is an interval graph.
AB - In this paper we study the Optimal Cost Chromatic Partition (OCCP) problem for trees and interval graphs. The OCCP problem is the problem of coloring the nodes of a graph in such a way that adjacent nodes obtain different colors and that the total coloring costs are minimum. In this paper we first give a linear time algorithm for the OCCP problem for trees. The OCCP problem for interval graphs is equivalent to the Fixed Interval Scheduling Problem with machine-dependent processing costs. We show that the OCCP problem for interval graphs can be solved in polynomial time if there are only two different values for the coloring costs. However, if there are at least four different values for the coloring costs, then the OCCP problem for interval graphs is shown to be NP-hard. We also give a formulation of the latter problem as an integer linear program, and prove that the corresponding coefficient matrix is perfect if and only if the associated intersection graph does not contain an odd hole of size 7 or more as a node-induced subgraph. Thereby we prove that the Strong Perfect Graph Conjecture holds for graphs of the form K × G, where K is a clique and G is an interval graph.
UR - http://www.scopus.com/inward/record.url?scp=84896784966&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84896784966&partnerID=8YFLogxK
U2 - 10.1007/3-540-62559-3_23
DO - 10.1007/3-540-62559-3_23
M3 - Conference contribution
AN - SCOPUS:84896784966
SN - 3540625593
SN - 9783540625599
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 279
EP - 292
BT - Graph-Theoretic Concepts in Computer Science - 22nd International Workshop, WG 1996, Proceedings
T2 - 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1996
Y2 - 12 June 1996 through 14 June 1996
ER -