Loading...
The maximum $k$-colorable subgraph problem and related problems
Kuryatnikova,Olga Sotirov,Renata Vera,J.C.
Kuryatnikova,Olga
Sotirov,Renata
Vera,J.C.
Abstract
The maximum k-colorable subgraph (MkCS) problem is to find an induced kcolorable subgraph with maximum cardinality in a given graph. This paper is an in-depth analysis of the MkCS problem that considers various semidefinite programming relaxations, including their theoretical and numerical comparisons. To simplify these relaxations, we exploit the symmetry arising from permuting the colors, as well as the symmetry of the given graphs when applicable. We also show how to exploit invariance under permutations of the subsets for other partition problems and how to use the MkCS problem to derive bounds on the chromatic number of a graph. Our numerical results verify that the proposed relaxations provide strong bounds for the MkCS problem and that those outperformexisting bounds formost of the test instances. Summary of Contribution: The maximum k-colorable subgraph (MkCS) problem is to find an induced k-colorable subgraph with maximum cardinality in a given graph. The MkCS problem has a number of applications, such as channel assignment in spectrum sharing networks (e.g.,Wi-Fi or cellular), very-large-scale integration design, human genetic research, and so on. The MkCS problem is also related to several other optimization problems, including the graph partition problem and the max-k-cut problem. The two mentioned problems have applications in parallel computing, network partitioning, floor planning, and so on. This paper is an in-depth analysis of theMkCS problem that considers various semidefinite programming relaxations, including their theoretical and numerical comparisons. Further, our analysis relates the MkCS results with the stable set and the chromatic number problems. We provide extended numerical results that verify that the proposed bounding approaches provide strong bounds for the MkCS problem and that those outperform existing bounds for most of the test instances. Moreover, our lower bounds on the chromatic number of a graph are competitive with existing bounds in the literature.
Description
Date
2022-01
Journal Title
Journal ISSN
Volume Title
Publisher
Files
Research Projects
Organizational Units
Journal Issue
Keywords
k-colorable subgraph problem, stable set, chromatic number of a graph, generalized theta number, semidefinite programming, Johnsons graphs, Hamming graphs
Citation
Kuryatnikova, O, Sotirov, R & Vera, J C 2022, 'The maximum $k$-colorable subgraph problem and related problems', INFORMS Journal on Computing, vol. 34, no. 1, pp. 656-669. https://doi.org/10.1287/ijoc.2021.1086