Funder
Natural Sciences and Engineering Research Council of Canada
Japan Society for the Promotion of Science
Japan Science and Technology Agency
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference39 articles.
1. A. Agrawal, On the parameterized complexity of happy vertex coloring, in: IWOCA 2017, 2017, pp. 103–115.
2. N. Aravind, S. Kalyanasundaram, A.S. Kare, Linear time algorithms for happy vertex coloring problems for trees, in: IWOCA 2016, 2016, pp. 281–292.
3. Algorithms and hardness results for happy coloring problems;Aravind,2017
4. Parameterized algorithms for the happy set problem;Asahiro,2020
5. Complexity and approximability of the happy set problem;Asahiro;Theoret. Comput. Sci.,2021
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献