On happy colorings, cuts, and structural parameterizations

DOI10.1007/978-3-030-30786-8_12OpenAlexW2974294792MaRDI QIDQ2301539

Ivan A. Bliznets, Danil Sagunov

Publication date: 24 February 2020

Full work available at URL: https://arxiv.org/abs/1907.06172

zbMATH Keywords

treewidthclique-widthparameterized complexityhappy coloringdistance to trivialityhomophily lawMaximum Happy EdgesMaximum Happy VerticesMultiway Cut

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Parameterized complexity of happy coloring problems ⋮ New algorithms for a simple measure of network partitioning ⋮ Parameterized algorithms for the happy set problem ⋮ New algorithms for a simple measure of network partitioning

This page was built for publication: On happy colorings, cuts, and structural parameterizations