Parameterized Algorithms for the Happy Set Problem-Reference-Cited by-同舟云学术

Parameterized Algorithms for the Happy Set Problem

Published:2020 Issue: Volume: Page:323-328
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Asahiro Yuichi,Eto Hiroshi,Hanaka Tesshu,Lin Guohui,Miyano Eiji,Terabaru Ippei

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-39881-1_27

Reference26 articles.

1. Agrawal, A.: On the parameterized complexity of happy vertex coloring. IWOCA 2017, 103–115 (2017)

2. Aravind, N., Kalyanasundaram, S., Kare, A.: Linear time algorithms for happy vertex coloring problems for trees. IWOCA 2016, 281–292 (2016)

3. Aravind, N., Kalyanasundaram, S., Kare, A., Lauri, J.: Algorithms and hardness results for happy coloring problems. arXiv preprint arXiv:1705.08282 (2017)

4. Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121, 15–26 (2002)

5. Bliznets, I., Sagunov, S.: On happy colorings, cuts, and structual parameterizations. arXiv preprint arXiv:1907.06172 (2019)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Happy Set Problem on Subclasses of Co-comparability Graphs;WALCOM: Algorithms and Computation;2022

2. Parameterized algorithms for the Happy Set problem;Discrete Applied Mathematics;2021-12

3. Complexity and approximability of the happy set problem;Theoretical Computer Science;2021-04

4. Computing L(p, 1)-Labeling with Combined Parameters;WALCOM: Algorithms and Computation;2021

5. Graph Classes and Approximability of the Happy Set Problem;Lecture Notes in Computer Science;2020