"Parameterized complexity of happy coloring problems."

Akanksha Agrawal et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2020.06.002

access: closed

type: Journal Article

metadata version: 2024-01-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/AgrawalAKKLMR20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AgrawalAKKLMR20
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy:
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.