The maximum happy induced subgraph problem: bounds and algorithms
type: Item
instance of: scholarly article
title: The maximum happy induced subgraph problem: bounds and algorithms
author: Rhyd Lewis
author: Dhananjay Thiruvady
author: Kerri Morgan
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350518
zbMATH Keywords: graph colouring
zbMATH Keywords: combinatorial optimisation
zbMATH Keywords: vertex cut sets
zbMATH Keywords: Tabu search
describes a project that uses: gCol
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105114
OpenAlex ID: W3092242673
cites work: Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
cites work: Q3452868
cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme
cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
cites work: Q4012216
cites work: The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
cites work: Graph coloring with adaptive evolutionary algorithms
cites work: Cluster Analysis
cites work: On the phase transitions of random \(k\)-constraint satisfaction problems
cites work: An experimental analysis of simple, distributed vertex coloring algorithms
cites work: Multiway cuts in node weighted graphs
cites work: A Guide to Graph Colouring
cites work: Finding happiness: an analysis of the maximum happy vertices problem
cites work: Algorithmic aspects of homophyly of networks
cites work: Parameterized graph separation problems
cites work: Generating Random Regular Graphs Quickly
cites work: Collective dynamics of ‘small-world’ networks
DOI: 10.1016/J.COR.2020.105114
Recommended article: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
Recommended article: Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
Recommended article: Improved approximation algorithms for the maximum happy vertices and edges problems
Recommended article: The approximation of maximum subgraph problems
Recommended article: Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
Recommended article: On the complexity of the Maximum Subgraph Problem
Recommended article: Exact Algorithm for the Maximum Induced Planar Subgraph Problem
Recommended article: Maximizing happiness in graphs of bounded clique-width
Recommended article: Graph classes and approximability of the happy set problem
Recommended article: Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem
description: scientific article; zbMATH DE number 7350518