Finding happiness: an analysis of the maximum happy vertices problem
type: Item
instance of: scholarly article
title: Finding happiness: an analysis of the maximum happy vertices problem
zbMATH Open document ID: 1458.05076
published in: Computers \& Operations Research
publication date: 2018-12-17T00:00:00Z
full work available at URL: MHVPaper.pdf
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6994281
zbMATH Keywords: happy colouring
zbMATH Keywords: graph colouring
zbMATH Keywords: problem subdivision
zbMATH Keywords: integer programming
author: Rhyd Lewis
author: Dhananjay Thiruvady
author: Kerri Morgan
describes a project that uses: gCol
MaRDI profile type: Publication
OpenAlex ID: W2900685636
cites work: On the parameterized complexity of happy vertex coloring
cites work: Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
cites work: Q3452868
cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
cites work: Cluster Analysis
cites work: Finding all minimum-size separating vertex sets in a graph
cites work: A Guide to Graph Colouring
cites work: Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
cites work: Algorithmic aspects of homophyly of networks
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: The parameterized complexity of happy colorings
cites work: Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
Wikidata QID: Q128889551
DOI: 10.1016/J.COR.2018.11.015
description: scientific article; zbMATH DE number 6994281