Parameterized algorithms for the happy set problem
From MaRDI portal
Publication:5896128
DOI10.1007/978-3-030-39881-1_27OpenAlexW3002002006MaRDI QIDQ5896128
Guo-Hui Lin, Ippei Terabaru, Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Eiji Miyano
Publication date: 22 July 2020
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-39881-1_27
Related Items (6)
Computing L(p,1)-Labeling with Combined Parameters ⋮ Happy set problem on subclasses of co-comparability graphs ⋮ Complexity and approximability of the happy set problem ⋮ Computing \(L(p, 1)\)-labeling with combined parameters ⋮ Parameterized algorithms for the happy set problem ⋮ Graph classes and approximability of the happy set problem
This page was built for publication: Parameterized algorithms for the happy set problem