Author:
Asahiro Yuichi,Eto Hiroshi,Hanaka Tesshu,Lin Guohui,Miyano Eiji,Terabaru Ippei
Publisher
Springer International Publishing
Reference29 articles.
1. Lecture Notes in Computer Science;A Agrawal,2018
2. Lecture Notes in Computer Science;NR Aravind,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. Lecture Notes in Computer Science;Y Asahiro,2020
5. Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121, 15–26 (2002)