Parameterized complexity of happy coloring problems

  • Main
  • 2020 / 6
  • Parameterized complexity of happy coloring problems
Theoretical Computer Science 2020 / 6

Parameterized complexity of happy coloring problems

Agrawal, Akanksha, Aravind, N.R., Kalyanasundaram, Subrahmanyam, Kare, Anjeneya Swami, Lauri, Juho, Misra, Neeldhara, Reddy, I. Vinod
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2020.06.002
Date:
June, 2020
File:
PDF, 1.43 MB
2020
Conversion to is in progress
Conversion to is failed