Establishes a reduction from Maximum Happy Vertices to Node Multiway Cut and resolves open questions on structural parameterizations for happy coloring and cut problems.
Theoretical Computer Science 412(50), 6982–7000 (Nov 2011)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Happy Colorings, Cuts, and Structural Parameterizations
Establishes a reduction from Maximum Happy Vertices to Node Multiway Cut and resolves open questions on structural parameterizations for happy coloring and cut problems.