1 citations · 2 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
On Happy Colorings, Cuts, and Structural Parameterizations
Ivan Bliznets, Danil Sagunov
We study the Maximum Happy Vertices and Maximum Happy Edges problems. The former problem is a variant of clusterization, where some vertices have already been assigned to clusters.…
cs.DS2019
Lower Bounds for the Happy Coloring Problems
Ivan Bliznets, Danil Sagunov
In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were s…