The Maximum Happy Induced Subgraph Problem: Bounds and Algorithms
Lewis, R., Thiruvady, D. and Morgan, K. 2021, The Maximum Happy Induced Subgraph Problem: Bounds and Algorithms, Computers and Operations Research, vol. 126, pp. 1-15, doi: 10.1016/j.cor.2020.105114.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
The Maximum Happy Induced Subgraph Problem: Bounds and Algorithms
In this paper we consider a combinatorial optimisation problem that takes as input a graph in which some of the vertices have been preassigned to colours. The aim is to then identify the largest induced subgraph in which all remaining vertices are able to assume the same colour as all of their neighbours. This problem shares similarities with the graph colouring problem, vertex cut problems, and the maximum happy vertices problem. It is NP-hard in general. In this paper we derive a number of upper and lower bounds and also show how certain problem instances can be broken up into smaller subproblems. We also propose one exact and two heuristic algorithms for this problem and use these to investigate the factors that make some problem instances more difficult to solve than others.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.